Skip to main content
Theoretical Computer Science

Explore our questions

Ask Question
more tags
Active 2 Bountied Hot Week Month
53 votes
21 answers
10k views

NP-hard problems on trees

Cyriac Antony's user avatar
Cyriac Antony
  • 1,869
1 vote
0 answers
205 views

Is the following spannin tree problem NP-hard or solvable in polynomial time?

Toyllo's user avatar
Toyllo
  • 71
12 votes
1 answer
213 views

Is $\sf P\neq NP\cap coNP$ relative to random oracle still open?

Stefan G.'s user avatar
Stefan G.
  • 291
10 votes
0 answers
278 views
+300

Computing permanents when we are promised that the value of the permanent is large

Gil Kalai's user avatar
Gil Kalai
  • 5,803
2 votes
0 answers
91 views

Interesting counting problems with polynomially many solutions

delete000's user avatar
delete000
  • 848
8 votes
3 answers
233 views

Are the notions of #P-completeness via Turing reductions and polynomial many-one counting reductions equivalent?

Tayfun Pay's user avatar
Tayfun Pay
  • 2,648
8 votes
2 answers
932 views

Proof Strategies on P versus BPP

Mikko Pitkonen's user avatar
Mikko Pitkonen
  • 11
1 vote
0 answers
46 views

Complexity of isotopy of embedded vertex colored graphs

AnT's user avatar
AnT
  • 11
4 votes
2 answers
207 views

NP-hardness of the edge covering with dynamic memory problem

Community's user avatar
CommunityBot
  • 1
8 votes
4 answers
2k views

Why is the circuit class AC0 unavoidable?

Manu's user avatar
Manu
  • 7,791
10 votes
1 answer
260 views

Non-relativization of MIP* = RE

Dmytro Taranovsky's user avatar
Dmytro Taranovsky
  • 2,742
0 votes
0 answers
67 views

Computational complexity of a complex exponential sum

Marcin Kotowski's user avatar
Marcin Kotowski
  • 2,806
16 votes
2 answers
499 views

Average-case tautologies/contradictions, beyond the random k-CNF model

Jan Johannsen's user avatar
Jan Johannsen
  • 4,765
2 votes
0 answers
69 views

Terminology for computation vs. output

Marzio De Biasi's user avatar
Marzio De Biasi
  • 23.2k
Browse more Questions