1445 search results - page 11 / 289 » Uniformly Hard Languages |
IJCAI
1997
13 years 9 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...