2303 search results - page 301 / 461 » On the logic of argumentation theory |
154
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
258
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
213
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
156
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...
156
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...