481 search results - page 50 / 97 » Martin's game: a lower bound for the number of sets |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
IANDC
2006
13 years 8 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each...
CCCG
2007
13 years 10 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
RSA
1998
13 years 8 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...