Explore our questions

0 votes
0 answers
47 views

Proof of coNE ⊆ NE/poly

3 votes
0 answers
51 views

Where is $\mathsf{BPP^{NP}}$ in the polynomial hierarchy?

6 votes
1 answer
461 views

Bijection between NP-complete problems

1 vote
0 answers
173 views

Perm and Det mod $2^k$ - II

5 votes
3 answers
15k views

what is the real difference between traveling salesman problem (TSP) and vehicle routing problem (VRP)?

0 votes
0 answers
40 views

On a modular inverse graph construction

8 votes
1 answer
215 views

deciding $\beta$-equality of planar lambda terms

2 votes
0 answers
59 views

On mod $p$ constructions related to determinant

3 votes
0 answers
46 views

Hardness of deciding fractional chromatic number at most $k$

0 votes
0 answers
88 views

On mod $2^i$ $+$-reducibility of permanent

3 votes
0 answers
58 views

Is there a complexity class defined as fixed Boolean combinations of problems in $\mathsf{BPP} \cup \mathsf{BH}$?

0 votes
0 answers
52 views

Why can't we just reduce from Bounded HALT to Bounded PCP?

-1 votes
0 answers
53 views

NTM preserving modular number of accepting paths

-2 votes
0 answers
52 views

Graph theoretic problems complete for certain counting classes

Browse more Questions