Search:  
Ans | A | Title
0 |   | Have people explored the problem of regular expressions being matc...
0 |   | Why isn't there a time hierarchy theorem that capitalizes on $...
0 |   | Circuit barriers for derandomizing in $RNC$ hierarchy?
0 |   | Complete problems for $NC^i$?
2 |   | Permutation phrases with LR parsing
1 | Y | Finding an answer key given tests and scores
2 |   | What would a quantum computer architecture look like?
0 |   | How big is the number of ways of writing t, up to m.r, as a sum of...
0 |   | Complexity of Homogenizing a String
0 |   | Hypergraph embedding and Euler Characteristics
0 |   | deciding $\beta$-equality of planar lambda terms
0 |   | What does $C_=L=NL$ and $\#L=GapL$ give?
0 |   | What is the computational complexity of this SAT Variant
2 | Y | Reference for the number of samples needed to distinguish two prob...
1 | Y | How to generate Skolem function in practice
1 | Y | Descriptive model theory classification of Counting hierarchy
0 |   | Efficiently check if a given set of balls cover a given set
0 |   | Efficiently computing the union of all minimal unsatisfiable const...
5 | Y | To what extent is "advanced mathematics" needed/useful i...
0 |   | Is there any algorithm to find just the largest eigenvalue with su...
2 | Y | Motivation for Dependent Type
1 | Y | Counting xyz-graphs in $\mathbb{Z}_n^3$
0 |   | Relationship between Pataraia's theorem and inductive-recursiv...
0 |   | Polynomial cases of 0 1 quadratic programm with linear constraints
12 | Y | What is the theoretical basis of imperative programming?
1 | Y | About reduction relation between $HP$ and $\mathcal{E}\mbox{*}$
1 |   | Is it possible to unambiguously read back λ terms from interactio...
1 |   | Graph factors of maximum weight
0 |   | Implication of Exponential Time Hypothesis falseness?
2 | Y | Is there a computing problem which is in quasi-polynomial time but...
0 |   | On earlier references for $P=BPP$ and Kolmogorov's possible vi...
0 |   | Williamson Earliest Due Date Rule Gives an Optimum Algorithm?
0 |   | If for every non-terminal in a cs-grammar there exists an obligato...
2 | Y | Lower bound on the largest restrained cubic subset
1 | Y | 3-coloring graph zero-knowledge proof
0 |   | Graph rewriting with one-to-many pattern matching?
1 |   | Math foundation for namespace problem
3 | Y | Is optimally solving the n×n×n Rubik's Cube NP-hard?
1 | Y | A proof that Partition into forests is NP-Complete
1 | Y | On $NP$ and $XP$ classes?
0 |   | Does $\Pi_1=\Pi_3$ imply the collapse of $PH$ to level 1?
3 | Y | Algorithm for finding heavy hitters in a weighted stream
0 |   | Why is HyperLogLog (near-)optimal?
1 | Y | Weighted nonoverlapping intervals
1 |   | BWT: is it possible to predict the next character in a sequence?
0 |   | What does L(R) depend on?
1 | Y | Parallel Pebble Game on a Line
1 | Y | hardness of constant approximation of largest matching set
4 | Y | List of TCS conferences and workshops
36 | Y | What Books Should Everyone Read?
Back