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

0 votes
0 answers
5 views

How is runtime downcasting modeled in type theory?

1 vote
0 answers
21 views
+50

Given several $a_i$-$r$ paths in a planar graph how ``balanced" of a tree rooted at $r$ can I make?

1 vote
0 answers
33 views

What is the relation between these two complexity classes -$FL_{log}(ZPLP)$ and $FL_{||}(ZPLP)$?

-1 votes
1 answer
93 views

What is the reason to believe that quantum heuristic algorithms can solve NP-Complete problems?

3 votes
1 answer
280 views

Dynamic transitive closure with immediate new reachability facts

14 votes
2 answers
1k views

Gaussian Elimination in terms of Group Action

3 votes
1 answer
359 views

Can Lexicographic BFS be implemented in logspace?

3 votes
1 answer
122 views

Is there an efficient algorithm to check for duplicator-invariant equivalence on symmetric interaction combinators?

1 vote
0 answers
15 views

Is minimum knot crossing number elementary recursive?

0 votes
0 answers
44 views

How to formulate the log-rank conjecture for non-boolean functions?

21 votes
2 answers
2k views
+100

What are the #P-complete subfamilies of #2-SAT?

0 votes
0 answers
14 views

What is an efficient algorithm to check for equivalence on symmetric interaction combinators?

0 votes
0 answers
39 views

help me understand what semiprime factorizations are worth

0 votes
1 answer
56 views

Exchange cards with sum requirement

Browse more Questions