1450 search results - page 12 / 290 » On the Complexity of Hardness Amplification |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
DLOG
2007
13 years 10 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
NC
2006
13 years 7 months ago
2006
A monomer structure based on a hairpin loop is described that can be linked via short oligonucleotide sequences (linkers) to form polymers. Independence of linked monomers allow fo...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...