Result 1 to 20 of 330 total
Holographic reduction, interpolation and hardness. (English)
Comput. Complexity 21, No. 4, 573-604 (2012).
1
Inapproximability of the Tutte polynomial of a planar graph. (English)
Comput. Complexity 21, No. 4, 605-642 (2012).
2
On the power of unambiguity in log-space. (English)
Comput. Complexity 21, No. 4, 643-670 (2012).
3
Extractors for varieties. (English)
Comput. Complexity 21, No. 4, 515-572 (2012).
4
Property testing lower bounds via communication complexity. (English)
Comput. Complexity 21, No. 2, 311-358 (2012).
5
Improved direct product theorems for randomized query complexity. (English)
Comput. Complexity 21, No. 2, 197-244 (2012).
6
Towards lower bounds on locally testable codes via density arguments. (English)
Comput. Complexity 21, No. 2, 267-309 (2012).
7
Bounded-depth circuits cannot sample good codes. (English)
Comput. Complexity 21, No. 2, 245-266 (2012).
8
A quantum characterization of NP. (English)
Comput. Complexity 21, No. 3, 499-510 (2012).
9
Length 3 edge-disjoint paths is NP-hard. (English)
Comput. Complexity 21, No. 3, 511-513 (2012).
10
On a theorem of Razborov. (English)
Comput. Complexity 21, No. 3, 431-477 (2012).
11
On reducing factorization to the discrete logarithm problem modulo a composite. (English)
Comput. Complexity 21, No. 3, 421-429 (2012).
12
Complexity and approximability of the cover polynomial. (English)
Comput. Complexity 21, No. 3, 359-419 (2012).
13
Low-depth witnesses are easy to find. (English)
Comput. Complexity 21, No. 3, 479-497 (2012).
14
On the security of Goldreich’s one-way function. (English)
Comput. Complexity 21, No. 1, 83-127 (2012).
15
Pseudorandom generators, typically-correct derandomization, and circuit lower bounds. (English)
Comput. Complexity 21, No. 1, 3-61 (2012).
16
Hierarchy theorems for property testing. (English)
Comput. Complexity 21, No. 1, 129-192 (2012).
17
Random low-degree polynomials are hard to approximate. (English)
Comput. Complexity 21, No. 1, 63-81 (2012).
18
Special issue: Computational complexity 2001. Selected papers based on the presentations at the 26th annual IEEE conference (CCC 2011), San Jose, CA, USA, June 8‒10, 2011. (English)
Comput. Complexity 21, No. 2, 193-358 (2012).
19
Special issue: RANDOM’09. Selected papers based on the presentations at the 13th RANDOM conference, Berkeley, CA, USA, August 2009. (English)
Comput. Complexity 21, No. 1, 192~p. (2012).
20
Result 1 to 20 of 330 total
Start
Contact
Print
General Help
