Theoretical Computer Science

Revival

 Revival
Answer more than 30 days after a question was asked as first answer scoring 2 or more. This badge can be awarded multiple times.
Awarded 632 times.
Fooling arbitrary symmetric functions
Awarded Feb 17, 2011 at 1:28
Graph decompositions for combining "local" functions of vertex labelings
Awarded Feb 12, 2011 at 0:17
How many distinct colors are needed to lower-bound the choosability of a graph?
Awarded Feb 11, 2011 at 13:26
Compared growth of the number of syntactic classes and Nerode classes.
Awarded Feb 10, 2011 at 8:18
Other applications of Karger-Stein branching amplification?
Awarded Feb 7, 2011 at 4:59
Is $coNP^{\#P}=NP^{\#P}=P^{\#P}$?
Awarded Feb 1, 2011 at 17:24
Is there a common mathematical symbology for collections?
Awarded Jan 19, 2011 at 14:14
Complexity of counting weighted cycles in planar graphs?
Awarded Jan 17, 2011 at 23:09
A direct sum theorem for Resolution clause space complexity?
Awarded Jan 17, 2011 at 8:17
What is the initialization time of a link-cut tree?
Awarded Jan 17, 2011 at 6:52
Binary multiplication and parity convolution
Awarded Jan 16, 2011 at 8:36
Are there local maxima in the number of moves required to solve a Rubik's Cube?
Awarded Jan 14, 2011 at 15:38
Ensemble of tree decompositions for all-pairs problem
Awarded Jan 10, 2011 at 22:06
Typical hardness of tree decomposition?
Awarded Jan 8, 2011 at 8:51
Fast sparse boolean matrix chain product
Awarded Jan 6, 2011 at 12:53
Hardness of constrained star system problem?
Awarded Dec 19, 2010 at 12:16
Refereed games with uncorrelated semi-private coins
Awarded Dec 8, 2010 at 19:52
Completeness and Context-Sensitive Languages.
Awarded Nov 25, 2010 at 23:38
UGC hardness of the predicate $NAE(x_1, ..., x_\ell)$ for $x_i \in GF(k)$?
Awarded Nov 21, 2010 at 21:53
Bounded-input bijections of infinite sequences
Awarded Nov 13, 2010 at 1:15
What are some career options for someone with a computer scientist master degree?
Awarded Nov 12, 2010 at 18:40
Other norms for Lattice reduction techniques (LLL, PSLQ)?
Awarded Nov 12, 2010 at 11:15
Unique Shapes of Binary Search Trees
Awarded Nov 12, 2010 at 5:05
Positive topological ordering, take 2
Awarded Nov 10, 2010 at 22:54
What is known about the complexity of finding minimum circuits for SAT?
Awarded Nov 8, 2010 at 7:35
Definition of a monotone machine.
Awarded Nov 4, 2010 at 17:48
Logspace algorithms on graphs with bounded tree width
Awarded Nov 2, 2010 at 3:57
Internal Regret in Online Convex Optimization
Awarded Nov 2, 2010 at 3:57
Has the derandomization of slightly non-uniform classes, e.g BPP/linear, been studied?
Awarded Nov 2, 2010 at 3:57
Given a weighted dag, is there an O(V+E) algorithm to replace each weight with the sum of its ancestor weights?
Awarded Nov 2, 2010 at 3:57
Is optimally solving the n×n×n Rubik's Cube NP-hard?
Awarded Nov 2, 2010 at 3:57
Space efficient "industrial" unbalanced expanders
Awarded Nov 2, 2010 at 3:57
1
…
7 8 9 10
11

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.