182 search results - page 29 / 37 » The Proof Complexity of Polynomial Identities |
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
FSTTCS
1992
Springer
14 years 1 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...