User Manu

93 votes

Accepted

Are runtime bounds in P decidable? (answer: no)

answered Feb 18, 2011 at 17:09

26 votes

Techniques for Reversing the Order of Quantiﬁers

answered Jan 22, 2011 at 14:41

19 votes

Applications of TCS to classical mathematics?

answered Aug 17, 2010 at 21:37

17 votes

Accepted

Best known joint containments for/by NP and Parity-P?

answered Aug 17, 2010 at 22:02

17 votes

Accepted

Simplest proof of NP-completeness

answered Feb 28, 2012 at 15:26

17 votes

Accepted

$\overline{SAT} \in NTIME(subexp)$?

answered Apr 9, 2014 at 15:18

16 votes

Accepted

On fooling $AC^0$

answered Mar 7, 2013 at 14:02

14 votes

What is the most efficient way to generate a random permutation from probabilistic pairwise swaps?

answered Mar 11, 2011 at 22:11

12 votes

Small steps for better TCS conferences?

answered May 8, 2011 at 17:52

12 votes

Algorithms from the Book

answered Aug 17, 2010 at 21:21

12 votes

Accepted

The Examiner's Problem (uniform generation of SAT decision instances/answers)

answered May 1, 2013 at 15:24

11 votes

Accepted

One-way functions with respect to various resource bounds

answered Sep 1, 2013 at 15:04

11 votes

Accepted

Good seating arrangements for sequence of meals and tables of size k for a group of people

answered Feb 17, 2013 at 14:59

11 votes

Accepted

Algorithm to find shortest path from a set of nodes to another set of nodes?

answered Feb 22, 2013 at 21:55

11 votes

Accepted

Fooling arbitrary symmetric functions

answered Feb 16, 2011 at 23:39

10 votes

Pseudorandom generator for finite automata

answered Dec 18, 2014 at 16:34

8 votes

Small steps for better TCS conferences?

answered Nov 26, 2011 at 22:26

8 votes

Difference between theory and practice of security and cryptography?

answered Dec 28, 2011 at 13:52

7 votes

What hierarchies and/or hierarchy theorems do you know?

answered Jul 11, 2011 at 14:58

7 votes

Accepted

What are the different notions of one-way functions?

answered Aug 25, 2010 at 17:29

7 votes

Testing for positivity instead of equality

answered May 3, 2013 at 13:33

6 votes

Major unsolved problems in theoretical computer science?

answered Mar 2, 2014 at 12:37

5 votes

Which complexity class does this number theory problem belong to?

answered Aug 13, 2015 at 17:22

5 votes

Additive combinatorics applications in algorithm design

answered Mar 14, 2015 at 17:47

4 votes

Classes of boolean functions where reasonable lower bounds on approximate degree is unknown?

answered Jun 5, 2015 at 14:12

4 votes

Size hierachy for uniform circuits

answered Dec 17, 2013 at 21:09

4 votes

Viola's Reduction of 3XOR to listing triangles

answered Feb 1, 2019 at 14:57

2 votes

Publishing short and simple results

answered Sep 11, 2020 at 20:47

2 votes

Is the the spectral norm of a Boolean function bounded by the degree of its Fourier expansion?

answered Mar 20, 2013 at 12:59

-1 votes

Small steps for better TCS conferences?

answered May 28, 2011 at 14:32

Stack Exchange Network

30 Answers

Are runtime bounds in P decidable? (answer: no)

Techniques for Reversing the Order of Quantiﬁers

Applications of TCS to classical mathematics?

Best known joint containments for/by NP and Parity-P?

Simplest proof of NP-completeness

$\overline{SAT} \in NTIME(subexp)$?

On fooling $AC^0$

What is the most efficient way to generate a random permutation from probabilistic pairwise swaps?

Small steps for better TCS conferences?

Algorithms from the Book

The Examiner's Problem (uniform generation of SAT decision instances/answers)

One-way functions with respect to various resource bounds

Good seating arrangements for sequence of meals and tables of size k for a group of people

Algorithm to find shortest path from a set of nodes to another set of nodes?

Fooling arbitrary symmetric functions

Pseudorandom generator for finite automata

Small steps for better TCS conferences?

Difference between theory and practice of security and cryptography?

What hierarchies and/or hierarchy theorems do you know?

What are the different notions of one-way functions?

Testing for positivity instead of equality

Major unsolved problems in theoretical computer science?

Which complexity class does this number theory problem belong to?

Additive combinatorics applications in algorithm design

Classes of boolean functions where reasonable lower bounds on approximate degree is unknown?

Size hierachy for uniform circuits

Viola's Reduction of 3XOR to listing triangles

Publishing short and simple results

Is the the spectral norm of a Boolean function bounded by the degree of its Fourier expansion?

Small steps for better TCS conferences?