|
Journals in DBLP
- Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
Homogenization and the polynomial calculus. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2002, v:11, n:3-4, pp:91-108 [Journal]
- Eli Ben-Sasson
Hard examples for the bounded depth Frege proof system. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2002, v:11, n:3-4, pp:109-136 [Journal]
- Lance Fortnow, John D. Rogers
Separability and one-way functions. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2002, v:11, n:3-4, pp:137-157 [Journal]
- Bruno Codenotti, Igor Shparlinski, Arne Winterhof
On the hardness of approximating the permanent of structured matrices. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2002, v:11, n:3-4, pp:158-170 [Journal]
|