Theoretical Computer Science

Help Center > Badges > Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 2277 times.
Time complexity for multiplying two lower triangular matrices
Awarded 14 hours ago
What Books Should Everyone Read?
Awarded Apr 5 at 6:15
What podcast should everybody listen to?
Awarded Apr 5 at 1:35
Best Upper Bounds on SAT
Awarded Mar 20 at 10:10
Is it possible to sort by only knowing the sign of pairwise sums?
Awarded Mar 12 at 22:40
Has the compactness theorem for FOL been formalized in Coq/Isabelle/etc?
Awarded Mar 10 at 2:20
Is there a notion of indistinguishability obfuscation for almost equivalent circuits?
Awarded Mar 9 at 8:25
FO(TC) lower bounding games?
Awarded Mar 5 at 15:45
Results on universal approximation for learners other than ANNs
Awarded Feb 27 at 15:45
What would be the next step after quantum computing?
Awarded Feb 27 at 15:20
What tools do you use to give presentations?
Awarded Feb 21 at 15:55
How is proving a context free language to be ambiguous undecidable?
Awarded Feb 18 at 8:50
Major unsolved problems in theoretical computer science?
Awarded Feb 10 at 17:25
Infinite process balls in bins problem
Awarded Feb 10 at 9:20
Are there problems in $DTIME(n^k) - DTIME(n^{k-1})$ that are not hard for $DTIME(n^{k-1})$ under nearly linear time reductions?
Awarded Feb 5 at 5:50
Lack of atomic propositions in the Calculus of Constructions from ATTAPL textbook
Awarded Feb 4 at 20:00
Minimum Unsatisfiable 3-CNF Formulae
Awarded Feb 2 at 5:40
Type of induction principle for fixpoint types
Awarded Feb 1 at 2:15
W[1]-hard problems with FPT time approximation algorithms
Awarded Jan 29 at 18:25
Minimum Unsatisfiable 3-CNF Formulae
Awarded Jan 24 at 7:00
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
1
2 3 4 5
…
38