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
63 views

Reference for complete problems for $FNP^{NP}$

7 votes
1 answer
972 views

Are there survey papers in theoretical computer science?

4 votes
0 answers
61 views

Are there classes for that FO-model checking is FPT on hypergraphs?

1 vote
0 answers
42 views
+50

Code indistinguishability assumption for Code based cryptography (in special cases)

2 votes
0 answers
47 views

Pebble games and conversions to bounded width circuits

8 votes
2 answers
510 views

Complexity of the $(3,2)_s$ SAT problem?

5 votes
1 answer
157 views

Establishing competing memory limits for pushdown automata

2 votes
0 answers
55 views

From formal models to programs - Model Checking

0 votes
0 answers
23 views

Minimax computation for classification problems with smooth densities functions

2 votes
2 answers
145 views

Seeking references on writing a long string $\ell$ as concatenation of shorter strings $s_1, s_2, s_3, ...$

0 votes
0 answers
53 views

Algorithms with advices of huge precomputed data

0 votes
0 answers
58 views

Programming languages with constraints on values of variables?

29 votes
2 answers
971 views

Polynomial method for complexity results

0 votes
2 answers
145 views

Where can I find the proof of the theorem and what is the computational complexity of the computably isomorphic map?

Browse more Questions