user avatar
user avatar
user avatar
Mateus de Oliveira Oliveira
  • Member for 11 years, 4 months
  • Last seen more than a month ago
22 votes
Accepted

What is the current known hardness of Graph Isomorphism?

18 votes
Accepted

Is adiabatic quantum computing as powerful as the circuit model?

16 votes
Accepted

Is there a theory to answer "the simplest program to solve a problem"?

16 votes
Accepted

Looking for Literature Source for Following idea

15 votes
Accepted

Is induced subgraph isomorphism easy on an infinite subclass?

13 votes
Accepted

What is known about the relationship between PR and NEXP?

11 votes

Surprising algorithms for counting problems

11 votes
Accepted

Testing isomorphism of asymmetric graphs

10 votes
Accepted

Is bounded-width SAT decidable in logspace?

9 votes
Accepted

The relationship between completeness and strength of reductions

9 votes
Accepted

Number of Automorphisms of a graph for graph isomorphism

8 votes

Does there exist a hardest DCFL?

8 votes
Accepted

minimal finite automata given in-words and out-words

7 votes

Minimum Tree-width of circuit for MAJORITY

7 votes
Accepted

Catalog of NP-complete problems, more up-to-date than Garey&Johnson?

6 votes
Accepted

automorphism in Cai-Furer-Immerman gadgets

4 votes

Is there a notion of computability on sets other than the natural numbers?

1 vote

Expressing a set of 0-1 strings by Extended Formulation