Theoretical Computer Science

Editor

 Editor
First edit.
Awarded 3916 times.
Problem in the paper “Stable Minimum Space Partitioning in Linear Time”
Awarded 2 days ago
Where does “Quine's Method” in propositional logic originate?
Awarded Jul 17 at 1:34
(post deleted or otherwise unavailable)
Awarded Jul 16 at 13:36
What is this structure? (monad with a kind of partial inverse comonad)
Awarded Jul 14 at 21:26
Expected number of node visits during random walk
Awarded Jul 13 at 20:07
3-partition problem is NP-complete. How about “N-partition problem”?
Awarded Jul 11 at 2:48
(post deleted or otherwise unavailable)
Awarded Jul 9 at 8:03
(post deleted or otherwise unavailable)
Awarded Jul 8 at 12:08
How to acknowledge answers of TCS in the paper?
Awarded Jul 8 at 5:45
(post deleted or otherwise unavailable)
Awarded Jul 7 at 21:35
Commutative operation benefits
Awarded Jul 7 at 20:05
Parametrization of context-sensitive language in polynomial time
Awarded Jul 6 at 9:05
Removing k vertices to obtain a Cycle Graph
Awarded Jul 5 at 10:31
(post deleted or otherwise unavailable)
Awarded Jul 1 at 11:07
(post deleted or otherwise unavailable)
Awarded Jun 29 at 12:20
Cost of Numerically Solving a System of P polynomials, each of V variables, and degree D to a Specific Accuracy
Awarded Jun 25 at 18:02
Hardness of maximizing $x^TAy$ with $\{-1,1\}$ entries
Awarded Jun 24 at 6:26
(post deleted or otherwise unavailable)
Awarded Jun 23 at 14:55
Reference request: characterisation of simultaneous substitution
Awarded Jun 23 at 10:31
How to build the tree with the “most different” solutions of a clustering?
Awarded Jun 22 at 20:45
Theorem on non-decreasing probability of success of an algorithm
Awarded Jun 21 at 9:56
(post deleted or otherwise unavailable)
Awarded Jun 19 at 13:55
Does every graph of clique-width 3 have a large induced subgraph of clique-width 2?
Awarded Jun 14 at 16:09
(post deleted or otherwise unavailable)
Awarded Jun 14 at 0:22
(post deleted or otherwise unavailable)
Awarded Jun 13 at 0:27
Is there a good notion of non-termination and halting proofs in type theory?
Awarded Jun 12 at 19:18
Sublinear Time Regular Expression Search
Awarded Jun 10 at 20:41
How is a “low-degree polynomial” precisely defined in Algebrization?
Awarded Jun 10 at 18:42
Find research partner (profession and beginner)
Awarded Jun 3 at 4:07
What is the polynomial representation of the Hamming weight function?
Awarded Jun 1 at 14:54
Example of an context-sensitive language with a specific number of words of length $n$
Awarded May 28 at 20:07
Finding uniformly random perfect matching of a graph
Awarded May 27 at 14:30
Resource for Understanding this Notation [closed]
Awarded May 27 at 3:46
(post deleted or otherwise unavailable)
Awarded May 25 at 16:55
Detect if a graph has a $k$ cycle in space complexity $O((\log k)^d)$ for fixed $d \geq1$
Awarded May 24 at 18:51
(post deleted or otherwise unavailable)
Awarded May 23 at 2:12
(post deleted or otherwise unavailable)
Awarded May 23 at 0:27
MLTT/MiniTT: why do normal forms of sum types carry environments?
Awarded May 22 at 12:51
(post deleted or otherwise unavailable)
Awarded May 18 at 7:42
(post deleted or otherwise unavailable)
Awarded May 18 at 4:09
How hard is this combinatorial optimisation problem?
Awarded May 17 at 5:55
Why is regularity a problem in cubical type theory?
Awarded May 15 at 11:27
(post deleted or otherwise unavailable)
Awarded May 12 at 13:55
(post deleted or otherwise unavailable)
Awarded May 11 at 23:16
(post deleted or otherwise unavailable)
Awarded May 10 at 14:19
Definitional function extensionality for functions out of $\mathbf{2}$
Awarded May 10 at 6:56
Finding vertex separator such that the induced subgraph has minimal number of edges
Awarded May 8 at 10:07
(post deleted or otherwise unavailable)
Awarded May 6 at 0:10
The implication of $ S(SAT)=2^{\Omega{(n)}} $ Conjecture (5.7 in Wigderson Book)
Awarded May 5 at 23:23
(post deleted or otherwise unavailable)
Awarded May 5 at 15:49
Are there strongly normalizing lambda terms that cannot be given a System F type?
Awarded May 1 at 19:23
Hamiltonian Cycle as an integer linear programming problem
Awarded Apr 29 at 18:57
Efficiently checking if removing a vertex yields a connected partition
Awarded Apr 29 at 7:27
program search with optimization methods for (resource bounded) Kolmogorov complexity
Awarded Apr 28 at 8:49
Algorithms Careers
Awarded Apr 26 at 14:10
Regular languages from category-theoretical point of view
Awarded Apr 26 at 7:48
(post deleted or otherwise unavailable)
Awarded Apr 25 at 2:36
(post deleted or otherwise unavailable)
Awarded Apr 20 at 16:52
(post deleted or otherwise unavailable)
Awarded Apr 13 at 21:39
Enumerating results of a variant of LCE queries
Awarded Apr 13 at 8:47
1
2 3 4 5
…
66

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.