35 search results - page 1 / 7 » Random Strings Make Hard Instances |
COCO
1994
Springer
13 years 9 months ago
1994
Springer
JSAT
2006
13 years 5 months ago
2006
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...