Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our questions

2 votes
0 answers
54 views

Is the Category of $(* \to)^n *$-kinded types freely generated from the discrete graph with $n$ nodes?

-1 votes
0 answers
82 views

Proof for Upper Bound on the Size of the Sum of Rational Numbers

16 votes
2 answers
1k views

Is there a SETH (Strong Exponential Time Hypothesis) for CSP (Constraint Satisfaction Problem)?

1 vote
1 answer
78 views

Learning arithmetic series

102 votes
41 answers
15k views

What are the recent TCS books whose drafts are available online?

4 votes
2 answers
522 views

Do we currently know a polynomial-size Frege proof for Tseitin formulas?

0 votes
1 answer
124 views

Finding deepest intersection

-1 votes
1 answer
75 views

Representation of binary strings by graphs and hypergraphs

16 votes
3 answers
1k views

Is the 3-sphere recognition problem NP-complete?

1 vote
0 answers
36 views

First-order linear mu-calculus?

0 votes
0 answers
46 views

Amplifying success probability for PTMs with $poly(n) / \exp(n)$ gap?

2 votes
0 answers
53 views

Approximately sampling from a discrete unimodal distribution with large support

6 votes
0 answers
274 views

Techniques for solving huge linear programs

3 votes
0 answers
103 views

How does NP-completess of decision problems relate to NP-completeness of search problems?

Browse more Questions