Theoretical Computer Science

Help Center > Badges > Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 2258 times.
Minimum Unsatisfiable 3-CNF Formulae
Awarded 2 days ago
Generating set of a group and relation to diameter?
Awarded Jan 8 at 15:30
Data structures for embedded simplicial complexes
Awarded Jan 6 at 16:45
NP-hard problems with very fast exponential-time algorithms
Awarded Dec 29 '19 at 19:25
Turing meta-oracle
Awarded Dec 29 '19 at 18:30
Complexity of graph isomorphism with properly colored edges (ref. request)
Awarded Dec 19 '19 at 20:05
Hardness of finding if a vertex lies on a simple directed path between two vertices
Awarded Dec 19 '19 at 8:35
Complexity of finding an edge set yielding specified vertex degrees
Awarded Dec 14 '19 at 2:35
Turing award papers
Awarded Dec 6 '19 at 17:05
Consequences of BPP=BQP
Awarded Nov 28 '19 at 16:20
Understanding non-equivalence of proof lengths according to proof systems
Awarded Nov 20 '19 at 22:00
Why NL is not L
Awarded Nov 10 '19 at 19:15
Making an adjacency matrix positive semidefinite
Awarded Nov 8 '19 at 2:25
Example of decidable NP-hard problem that is not NP-complete
Awarded Nov 7 '19 at 23:45
Where does a C-like language without heaps belong in the automata hierarchy?
Awarded Nov 6 '19 at 10:00
Document references describing weaknesses for cutting planes and algebraic proof system?
Awarded Nov 4 '19 at 12:05
Are patents good sources for academic research?
Awarded Nov 1 '19 at 20:10
Is the wording of Google's QC Supremacy valid?
Awarded Oct 30 '19 at 0:00
Co-NP definition
Awarded Oct 27 '19 at 22:35
How to efficiently read the theoretical computer science research papers?
Awarded Oct 27 '19 at 15:50
Level $k$ bounds in Analysis of Boolean functions
Awarded Oct 20 '19 at 20:50
Vertex Cover applications in the real world
Awarded Oct 12 '19 at 15:40
Re-packing of integers into fixed-size bins
Awarded Oct 10 '19 at 22:40
Find the shortest s-t trail(edge disjoint path) in a graph with negative weight edges
Awarded Oct 8 '19 at 19:15
Does “Second X is NP-complete” imply “X is NP-complete”?
Awarded Oct 8 '19 at 14:40
Reordering data (set of strings) to optimize for compression?
Awarded Oct 5 '19 at 4:25
A Question on Convex Conjugate Duality for KL Divergence
Awarded Oct 4 '19 at 18:20
Complexity of the simplex algorithm
Awarded Sep 29 '19 at 17:05
Can we have more than one Deterministic Finite Automata diagrams for a set of strings?
Awarded Sep 25 '19 at 19:00
What are some good resources for strengthening my theoretical foundation for machine learning?
Awarded Sep 25 '19 at 18:25
Dividing a complete graph into two cliques with maximal sum of edge weights
Awarded Sep 24 '19 at 6:30
How long does it take to find a short cycle in a random graph?
Awarded Sep 21 '19 at 10:15
List of quantum-inspired algorithms
Awarded Sep 19 '19 at 19:50
Terminology and references for a learning model
Awarded Sep 19 '19 at 5:55
When is the duality gap of semidefinite programming (SDP) zero?
Awarded Sep 17 '19 at 22:40
An upper bound for chi-square divergence in terms of KL divergence for general alphabets
Awarded Sep 12 '19 at 21:55
Correlation between noise resilience and output distribution of Boolean circuits
Awarded Sep 11 '19 at 20:20
Completeness under injective Karp reductions
Awarded Sep 10 '19 at 22:05
Evidence that matrix multiplication is not in $O(n^2\log^kn)$ time
Awarded Sep 10 '19 at 15:55
PPAD and Quantum
Awarded Sep 9 '19 at 7:10
Animate a graphviz graph
Awarded Sep 7 '19 at 7:00
What is the difference between standard SIFT descriptor and upright SIFT descriptor?
Awarded Sep 6 '19 at 21:50
What kind of answer does TCS want to the question “Why do neural networks work so well?”
Awarded Sep 6 '19 at 16:30
An efficient algorithm for maximizing gain by choosing from a set of options
Awarded Aug 27 '19 at 12:20
Applications of Takens' theorem to TCS?
Awarded Aug 25 '19 at 18:55
What is a natural problem in theory of computation?
Awarded Aug 25 '19 at 4:45
Consequences/existence of problems without any “optimal” algorithm
Awarded Aug 21 '19 at 3:45
Lattice problems
Awarded Aug 19 '19 at 23:50
Formalizing and optimizing constraints involving booleans, pairs of booleans, and integer sums
Awarded Aug 15 '19 at 11:35
Hospital Resident Matching Algorithm with Incomplete Preferences
Awarded Aug 13 '19 at 3:30
Deterministic Realtime Languages
Awarded Aug 13 '19 at 1:20
what does NP ⊆ DTIME(…) mean?
Awarded Aug 12 '19 at 21:25
Find the maximum subset contained by a ball of radius R
Awarded Aug 7 '19 at 11:00
DPDA with parameterized states
Awarded Aug 2 '19 at 10:50
reference request for construction of expanders
Awarded Jul 27 '19 at 13:00
The theory of definitions in first order logic
Awarded Jul 23 '19 at 22:45
What is the formal definition of a stacked based finite state machine?
Awarded Jul 21 '19 at 14:25
Proper PAC learning VC dimension bounds
Awarded Jul 11 '19 at 4:40
What is the reason to use NP instead of EXP as 'the' class of intractable problems?
Awarded Jul 7 '19 at 19:00
(post deleted or otherwise unavailable)
Awarded Jul 6 '19 at 20:00
1 2 3 4 5 … 38