Skip to main content

Explore our questions

0 votes
1 answer
4 views

Is oriented simple graph isomorphism GI-hard?

0 votes
1 answer
289 views

Where to read about PSO (partial store order) memory model

53 votes
21 answers
10k views

NP-hard problems on trees

1 vote
0 answers
204 views

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

0 votes
2 answers
49 views

Combining different length epsilon-ADU hash function families

1 vote
1 answer
337 views

Generalization of Büchi-Elgot-Trakhtenbrot theorem

12 votes
1 answer
210 views

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

10 votes
0 answers
277 views
+300

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

5 votes
1 answer
100 views

Transforming finite automata with graph rewriting

9 votes
3 answers
2k views

In the context of regular languages, must the alphabet be finite?

0 votes
0 answers
46 views

Agnostic PAC learning - equivalent definitions?

4 votes
0 answers
135 views

Decidability of CFL Equivalence with Fixed Regular Language

2 votes
0 answers
91 views

Interesting counting problems with polynomially many solutions

0 votes
0 answers
56 views

A Conceptual Question About Online Algorithms

Browse more Questions