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

6votes
0answers
160views
Examples of simulations in proof complexity that are not p-simulations
0votes
0answers
19views
Is there a way to define dependent types without explicit substitutions internally within agda?
1vote
1answer
71views
What type of Problems (Class and types) Can Be Solved Effectively with Quantum Computers?
4votes
1answer
108views
Complexity of Yao's tiling number?
0votes
0answers
58views
+50
Maximize the mutual information between 2 discrete random variables
0votes
0answers
44views
Complexity of projected model counting
3votes
0answers
39views
Extremal Ellipsoids
0votes
0answers
53views
Alternating hamilton cycles problem in 2-edge-colored graphs
2votes
1answer
73views
Proof of SPFA's worst-case complexity?
-1votes
0answers
28views
Is there an efficient way to generate a psuedo-boolean function from a linear constraint?
1vote
0answers
53views
Is finding a very large clique NP-hard?
-1votes
0answers
24views
$K_t-Hitting$ is FPT?
3votes
1answer
252views
Distinguishing permanent from false value
Browse more Questions