Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
V Vinay
Bangalore, India
http://www.limberlink.com
Entrepreneur, teacher, with an interest in theory.
top
accounts
reputation
activity
subscriptions
Top Questions
47
votes
Are there Conservation Laws in Complexity Theory?
cc.complexity-theory
big-picture
asked Nov 16, 2010 at 19:39
cstheory.stackexchange.com
20
votes
Parity and $AC^0$
cc.complexity-theory
complexity-classes
lower-bounds
circuit-complexity
asked Nov 18, 2010 at 19:03
cstheory.stackexchange.com
Top Answers
69
Advice on good research practices
cstheory.stackexchange.com
39
Why are mod_m gates interesting?
cstheory.stackexchange.com
33
How practical is Automata Theory?
cstheory.stackexchange.com
27
Alan Turing's Contributions to Computer Science
cstheory.stackexchange.com
15
Monotone arithmetic circuits
cstheory.stackexchange.com
14
CFG parsing using $o(n^2)$ space
cstheory.stackexchange.com
14
Machine characterization of $SAC^i$
cstheory.stackexchange.com
13
Why are linear bounded automata not as popular as other automata?
cstheory.stackexchange.com
13
Does L have a definition in terms of circuits?
cstheory.stackexchange.com
11
If you could rename dynamic programming...
cstheory.stackexchange.com
11
Alternate proofs of Immerman-Szelepcsenyi theorem
cstheory.stackexchange.com
10
Does there exist a complexity class such that the number of accepting paths is a prime number?
cstheory.stackexchange.com
10
Improved lower bound on monotone circuit complexity of perfect matching?
cstheory.stackexchange.com
10
Dynamic programming and shortest path problem
cstheory.stackexchange.com
8
Does $\mathsf{P/poly}$ have subexponential-size bounded-depth circuits?
cstheory.stackexchange.com
7
Proof of the pumping lemma for context-free languages using pushdown automata
cstheory.stackexchange.com
7
Deterministic Parallel algorithm for perfect matching in general graphs?
cstheory.stackexchange.com
7
Human intelligence and algorithms
cstheory.stackexchange.com
6
Papers to credit for spectral partitioning of graphs
cstheory.stackexchange.com
5
Complexity of a certain leaf language with Prime & Composite number of accepting paths.
cstheory.stackexchange.com
5
Other applications of Karger-Stein branching amplification?
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled