Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
Theoretical Computer Science

Help Center > Badges > Editor

 Editor
First edit.
Awarded 3534 times.
Lower bounds for list/set data structures without delete
Awarded Nov 18 at 15:10
What Is the Complexity of This Two-to-One Matching Problem?
Awarded Nov 14 at 12:00
Approximation quality of a simple linearization of binary quadratic program
Awarded Nov 14 at 8:55
Are endmarkers necessary for Deterministic Pushdown Automata?
Awarded Nov 13 at 11:05
How to find for each 3-input boolean function the minimum number of NAND operators needed to compute it [closed]
Awarded Nov 11 at 10:50
(post deleted or otherwise unavailable)
Awarded Nov 10 at 15:30
Example of decidable NP-hard problem that is not NP-complete
Awarded Nov 7 at 23:15
Why NL is not L
Awarded Nov 7 at 12:35
(post deleted or otherwise unavailable)
Awarded Nov 6 at 0:30
Which complexity class does this problem belong to?
Awarded Nov 4 at 14:55
(post deleted or otherwise unavailable)
Awarded Nov 4 at 1:10
Site with collection of exercises in TCS?
Awarded Nov 3 at 6:55
Are patents good sources for academic research?
Awarded Oct 29 at 23:30
NP-hardness of a planar SAT variant
Awarded Oct 27 at 22:05
Characterize a point cloud
Awarded Oct 23 at 9:10
Turing meta-oracle
Awarded Oct 23 at 2:20
(post deleted or otherwise unavailable)
Awarded Oct 22 at 2:25
How to efficiently read the theoretical computer science research papers?
Awarded Oct 21 at 16:50
(post deleted or otherwise unavailable)
Awarded Oct 19 at 11:35
LogSpace reductions vs. PTime reductons for defining PSpace-completeness
Awarded Oct 18 at 8:10
Majority function stability under deletion and addition of entries
Awarded Oct 17 at 23:30
Maximization of Mutual Information
Awarded Oct 17 at 20:50
Maximization of Mutual Information
Awarded Oct 17 at 19:20
conversion to DAG
Awarded Oct 13 at 16:10
(post deleted or otherwise unavailable)
Awarded Oct 12 at 21:05
Chomsky-Schutzenberg Hierarchies explained for physicist (general) [closed]
Awarded Oct 10 at 0:55
(post deleted or otherwise unavailable)
Awarded Oct 9 at 17:00
Finding simple fixed length paths in directed graphs
Awarded Oct 8 at 21:50
(post deleted or otherwise unavailable)
Awarded Oct 8 at 17:55
Breaking cycles in network graph by adding nodes and rerouting edges
Awarded Oct 8 at 14:35
Difference between CTMC, DTMC, and MDP
Awarded Oct 6 at 1:15
Reordering data (set of strings) to optimize for compression?
Awarded Oct 5 at 4:25
(post deleted or otherwise unavailable)
Awarded Oct 2 at 12:00
How are safety/liveness languages defined on the set of finite or infinite words?
Awarded Sep 27 at 18:45
(post deleted or otherwise unavailable)
Awarded Sep 27 at 10:35
Obtaining the Axiom of Choice through a modality in HTT
Awarded Sep 25 at 17:45
Network Reliability Problem
Awarded Sep 23 at 16:40
(post deleted or otherwise unavailable)
Awarded Sep 23 at 3:10
Open access journals
Awarded Sep 20 at 8:50
What papers should everyone read?
Awarded Sep 19 at 22:15
When is the duality gap of semidefinite programming (SDP) zero?
Awarded Sep 19 at 21:35
(post deleted or otherwise unavailable)
Awarded Sep 19 at 12:25
Reconstruction of a sequence generated by a Markov chain - reference request
Awarded Sep 17 at 14:40
Transforming Lambda Calculus syntax into generic relations between finite strings
Awarded Sep 16 at 16:00
(post deleted or otherwise unavailable)
Awarded Sep 15 at 20:15
Volume computation of special polytopes
Awarded Sep 11 at 20:55
Satisfiability problems with restricted (not bounded) number of occurrences per variable
Awarded Sep 11 at 11:55
(post deleted or otherwise unavailable)
Awarded Sep 10 at 23:55
(post deleted or otherwise unavailable)
Awarded Sep 8 at 14:00
Completeness under injective Karp reductions
Awarded Sep 7 at 8:45
Complete problems for FP
Awarded Sep 5 at 20:05
(post deleted or otherwise unavailable)
Awarded Aug 31 at 4:05
An efficient algorithm for maximizing gain by choosing from a set of options
Awarded Aug 27 at 12:45
Prove proof irrelevance in Coq?
Awarded Aug 26 at 15:40
Complexity of extracting a coefficient of a polynomial in multiple variables
Awarded Aug 26 at 4:50
How to prove a general convex set is nonempty or empty in polynomial time?
Awarded Aug 22 at 7:15
3-coloring planar graphs in $O\left(3^{n^.5}\right)$?
Awarded Aug 20 at 0:20
(post deleted or otherwise unavailable)
Awarded Aug 19 at 16:50
Formalizing and optimizing constraints involving booleans, pairs of booleans, and integer sums
Awarded Aug 14 at 12:30
(post deleted or otherwise unavailable)
Awarded Aug 14 at 6:20
1 2 3 4 5 … 59