As of May 31, 2023, we have updated our Code of Conduct.
Theoretical Computer Science

Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 2543 times.
Notation problem
Awarded 2 days ago
Test set and benchmarks for linear programming
Awarded May 28 at 16:43
factoring large numbers
Awarded May 28 at 16:43
Can I define nested mutually dependent types in Coq?
Awarded May 13 at 19:42
Efficient algorithm/ implementation to compute Transitive Closure of a Rule with respect to a Relationship
Awarded May 9 at 15:15
Is it known if $\mathrm{CFL} \subseteq\mathrm{ NSPACE}(o(log^2(n)))$?
Awarded Apr 28 at 14:25
Resumption-based IO systems?
Awarded Apr 26 at 8:48
Direct Proof that the Pigeonhole Principle is Hard for Regular Resolution
Awarded Apr 20 at 19:42
Why is SVP not in coNP if Gram Schmidt Orthogonalization can provide us with a lower bound of the shortest vector
Awarded Apr 19 at 2:50
What's the difference between an invariant and an "inductive" invariant?
Awarded Apr 16 at 5:05
Can an unrestricted grammar have a rule with only terminals on the left-hand side?
Awarded Apr 15 at 13:49
Complexity of Finding the Eigendecomposition of a Matrix
Awarded Apr 15 at 5:58
What are the #P-complete subfamilies of #2-SAT?
Awarded Apr 14 at 10:16
doubt in the proof of reducing any arithmetic circuit to log(d) depth, where d is the degree of the polynomial it is computing
Awarded Apr 13 at 2:50
Why isn't the proof obtained using Buss's proof of the derivational completeness of LK anchored?
Awarded Apr 10 at 6:55
$DTIME_1(o(n^2))\setminus$ REGULAR
Awarded Apr 8 at 22:05
Planted Clique in G(n,p), varying p
Awarded Apr 1 at 15:05
What's the relation between applicative bisimulation and context equivalence in the $\lambda$-calculus?
Awarded Mar 30 at 8:27
(post deleted or otherwise unavailable)
Awarded Mar 27 at 23:20
Yet another constructive (Coq) proof that `nat -> nat -> nat` is not bijective. How to explain it to myself?
Awarded Mar 24 at 19:19
What are some algorithms where space complexity tends to be the limiting factor in practice?
Awarded Mar 19 at 4:09
Theoretical Computer Science vs other Sciences?
Awarded Mar 16 at 12:06
Theoretical Computer Science vs other Sciences?
Awarded Mar 16 at 12:06
Is there a purely functional vector with O(1) access to the front and back but O(log n) concatenation?
Awarded Mar 14 at 22:32
Theoretical Computer Science vs other Sciences?
Awarded Mar 14 at 17:04
Theoretical Computer Science vs other Sciences?
Awarded Mar 14 at 10:03
Turing Machines and Logic
Awarded Mar 11 at 22:40
NP-hardness: (planar) directed feedback vertex set problem with bounded degree
Awarded Mar 10 at 10:17
Does this game terminate?
Awarded Mar 7 at 6:57
Defining regular language classes with disjoint union
Awarded Feb 28 at 14:21
How far is the distance between Mahlo Universe and Mahlo Cardinal?
Awarded Feb 22 at 18:51
Johnson-Lindenstrauss and the largest eigenvalue of a matrix
Awarded Feb 19 at 1:09
Johnson-Lindenstrauss and the largest eigenvalue of a matrix
Awarded Feb 18 at 23:20
What is known about (upper bounds on) the LP gap of the (symmetric) Travelling salesman in special instances?
Awarded Feb 6 at 21:19
Entries of the Inverse Laplacian
Awarded Feb 6 at 19:25
Fixpoint of a functor in the category of embeddings
Awarded Jan 31 at 9:41
Most efficient inplace merge algorithms (stable and unstable)
Awarded Jan 30 at 22:26
Hashing-based vs almost uniform sampling-based approximate counting
Awarded Jan 26 at 23:26
Free type variables in Hindley-Milner type inference
Awarded Jan 26 at 6:21
Is there any book on the philosophical implications of Theoretical Computer Science?
Awarded Jan 16 at 22:06
Boosting the probability of success(random projections, johnson lindenstrauss)
Awarded Jan 11 at 21:55
Computational complexity problem book with solution recommendation?
Awarded Jan 5 at 19:05
Time complexity of Held-Karp algorithm for TSP
Awarded Dec 31, 2022 at 2:06
Functional Completeness of 3-valued logic
Awarded Dec 15, 2022 at 12:25
Proper terminology for input, parameter or variable fixing. Refinement? Projection? Fixation? Partial valuation?
Awarded Dec 14, 2022 at 16:11
Treewidth relations between Boolean formulas and Tseitin encodings
Awarded Dec 9, 2022 at 13:53
Is this subsequence problem NP-hard?
Awarded Dec 8, 2022 at 22:47
Is that edge orientation optimization problem NP-hard?
Awarded Dec 2, 2022 at 21:55
Spectral sparsification of graphs with negative edge weights
Awarded Dec 1, 2022 at 9:26
Regarding UNSAT bechmark of SATLIB found as SAT instance
Awarded Nov 30, 2022 at 23:06
What exactly is "large elimination"?
Awarded Nov 16, 2022 at 9:07
Composition with recursion in functions between types
Awarded Nov 12, 2022 at 0:31
2xn grid graphs from ring graphs via local complementations
Awarded Nov 4, 2022 at 6:42
Can typed lambda calculi express *all* algorithms below a given complexity?
Awarded Nov 2, 2022 at 23:27
Finding cliques in a big graph
Awarded Nov 2, 2022 at 13:55
Can we use relational parametricity to simplify the type $\forall a. ( (a \to r) \to r ) \to (a \to r) \to r$?
Awarded Oct 29, 2022 at 18:18
Solution for a bipartite demand and supply graph
Awarded Oct 26, 2022 at 11:42
Are all linear-rate and -distance classical linear codes expanding?
Awarded Oct 25, 2022 at 7:33
Theorem of Sudan, Trevisan and Vadhan about list-decoding
Awarded Oct 21, 2022 at 6:20
Multidimensional Knapsack W[1]-hard when parameterized by dimension
Awarded Oct 17, 2022 at 14:26
1
2 3 4 5
…
43

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.