User Ross Snider

30 votes

6 answers

1k views

Well known classes of boolean formulas that require exponentially long resolution proofs

asked Aug 20, 2010 at 2:02

27 votes

2 answers

1k views

Complexity of Topological Properties.

asked May 11, 2011 at 3:17

23 votes

2 answers

1k views

How does the Mulmuley-Sohoni geometric approach to producing lower bounds avoid producing natural proofs (in the Razborov-Rudich sense)?

asked Aug 17, 2010 at 16:50

13 votes

1 answer

594 views

What languages have been successfully cryptographically trapdoored?

asked Jan 26, 2011 at 18:45

10 votes

2 answers

484 views

Do good PCPs for NP give us good PCPs for the entire polynomial hierarchy?

asked Dec 12, 2011 at 20:30

5 votes

1 answer

1k views

Computational complexity of modular power towers (tetration)

asked Jun 19, 2015 at 21:37

3 votes

0 answers

95 views

Closest Vector Problem with sparse basis and target vector

asked May 1, 2013 at 15:34

2 votes

0 answers

270 views

Some problems involving polynomials of public and private variables over GF(2).

asked Sep 1, 2010 at 2:54

1 vote

0 answers

100 views

Nearly-uniformally sampling lattice points from a basis that lie on the interior of a polytope

asked Jan 4, 2014 at 1:17

Stack Exchange Network

9 Questions

Well known classes of boolean formulas that require exponentially long resolution proofs

Complexity of Topological Properties.

How does the Mulmuley-Sohoni geometric approach to producing lower bounds avoid producing natural proofs (in the Razborov-Rudich sense)?

What languages have been successfully cryptographically trapdoored?

Do good PCPs for NP give us good PCPs for the entire polynomial hierarchy?

Computational complexity of modular power towers (tetration)

Closest Vector Problem with sparse basis and target vector

Some problems involving polynomials of public and private variables over GF(2).

Nearly-uniformally sampling lattice points from a basis that lie on the interior of a polytope