Theoretical Computer Science

Editor

 Editor
First edit.
Awarded 4427 times.
Modify DCFG to enforce length limit
Awarded 2 days ago
(post deleted or otherwise unavailable)
Awarded Apr 12 at 0:41
(post deleted or otherwise unavailable)
Awarded Apr 11 at 10:36
Theorem 2.4(i) in Valiant-Vazirani paper "NP is as easy as detecting unique solutions"
Awarded Apr 10 at 19:27
what is the real difference between traveling salesman problem (TSP) and vehicle routing problem (VRP)?
Awarded Apr 9 at 7:25
How does gcd in $\mathbb Z_p[x]$ and $\mathbb Z_q[x]$ relate to gcd in $\mathbb Z_n[x]$?
Awarded Apr 7 at 7:50
(post deleted or otherwise unavailable)
Awarded Apr 5 at 21:35
Data structure whose name starts with the letter “N”?
Awarded Apr 5 at 12:09
Comparing Shor's and Regev's Quantum Factoring algorithm
Awarded Apr 5 at 0:55
Is there a complexity class defined as fixed Boolean combinations of problems in $\mathsf{BPP} \cup \mathsf{BH}$?
Awarded Apr 3 at 23:46
Is there a generalized SAT problem for many-valued logics?
Awarded Apr 1 at 21:47
Hardness of Computing Tribes-DNF by Decision Trees
Awarded Mar 27 at 20:26
Separating disjoint PSPACE-hard sets by NP-separators (and some variants)
Awarded Mar 27 at 20:06
(post deleted or otherwise unavailable)
Awarded Mar 26 at 14:48
Learning a regular language with a specified closure property
Awarded Mar 24 at 20:20
Does there exist a cryptographic associative hash function?
Awarded Mar 24 at 3:09
Is there any augmenting graph algorithm available for finding maximum independent set problem in K1,4-free graph in polynomial time
Awarded Mar 22 at 9:15
Is there any augmenting graph algorithm available for finding maximum independent set problem in K1,4-free graph in polynomial time
Awarded Mar 22 at 9:15
How to prove clock equivalence is a time-abstracted bisimulation
Awarded Mar 20 at 10:26
(post deleted or otherwise unavailable)
Awarded Mar 16 at 13:04
Complexity of chess with 50-move rule
Awarded Mar 16 at 11:20
strong NP-completeness of multi-dimensional Equal-Subset-Sum
Awarded Mar 15 at 18:00
Is (Restricted) Bigraph Isomorphism Weaker than Graph Isomorphism?
Awarded Mar 14 at 16:56
Unbounded Knapsack: Does Increasing capacity increase optimal value?
Awarded Mar 14 at 14:18
List of nice non-context-free languages
Awarded Mar 8 at 10:47
Data structure whose name starts with the letter “N”?
Awarded Mar 8 at 7:32
(post deleted or otherwise unavailable)
Awarded Mar 6 at 13:37
(post deleted or otherwise unavailable)
Awarded Mar 5 at 0:35
Resource-bounded variant of Kolmogorov complexity
Awarded Mar 4 at 18:21
Sequential Two-player Game related to "Bandit Detection"
Awarded Feb 29 at 17:11
The role of Turing machines in computational complexity [closed]
Awarded Feb 28 at 17:57
How to think about coherent spaces intuitively?
Awarded Feb 28 at 17:10
Distance between Fourier distributions of independent random Boolean functions
Awarded Feb 27 at 23:56
(post deleted or otherwise unavailable)
Awarded Feb 26 at 11:45
Monads whose Kleisli arrows can be "applicativized"
Awarded Feb 26 at 5:47
References for algorithms to compute approximating polytopes for arbitrary convex sets
Awarded Feb 26 at 3:16
Enumerating all Vertex Covers of Size at most $k$
Awarded Feb 25 at 13:55
(post deleted or otherwise unavailable)
Awarded Feb 24 at 21:55
(post deleted or otherwise unavailable)
Awarded Feb 24 at 10:08
Uniform lower bounds in terms of the matrix multiplication exponent $\omega$?
Awarded Feb 23 at 22:18
Placing a circle in a point cloud
Awarded Feb 23 at 19:25
Complexity of solving random underdetermined polynomial equations over finite fields
Awarded Feb 22 at 19:18
property of minimal triangulations
Awarded Feb 20 at 17:50
What algorithms are there for ANN?
Awarded Feb 16 at 13:56
(post deleted or otherwise unavailable)
Awarded Feb 16 at 7:51
Homeomorphic subtree extraction in integer sorting time
Awarded Feb 14 at 21:28
Learning discrete math for research
Awarded Feb 14 at 20:56
Horn clause on cnf
Awarded Feb 14 at 2:51
Are there any candidate languages in NE but not E?
Awarded Feb 13 at 13:26
Algorithm to check whether a given set is Sidon
Awarded Feb 10 at 14:26
On The Complexity of Block-Interchange Distance for Binary Strings
Awarded Feb 7 at 0:51
Working out the constants and probabilities of Stockmeyer's approximate counting algorithm
Awarded Feb 6 at 23:46
(post deleted or otherwise unavailable)
Awarded Feb 5 at 15:25
What papers should everyone read?
Awarded Feb 4 at 10:36
Upper bound on the number of maximal paths in rooted intransitive DAGs
Awarded Jan 28 at 0:07
(post deleted or otherwise unavailable)
Awarded Jan 26 at 1:08
Tree decompositions with unique witness for each edge
Awarded Jan 25 at 8:48
(post deleted or otherwise unavailable)
Awarded Jan 24 at 19:17
(post deleted or otherwise unavailable)
Awarded Jan 21 at 17:26
(post deleted or otherwise unavailable)
Awarded Jan 20 at 23:30
1
2 3 4 5
…
74