612 search results - page 12 / 123 » Hardness assumptions in the foundations of theoretical compu... |
MFCS
1990
Springer
13 years 11 months ago
1990
Springer
The plausibility of computing the answers to many membership queries to a hard set with few queries is the subject of the theory of terseness. In this paper, we develop companion ...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
FOCS
2000
IEEE
14 years 3 days ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...