Skip to main content

Explore our questions

0 votes
0 answers
21 views

Are Turing Machines Models?

0 votes
0 answers
18 views

Work-efficient parallelization of matrix chain multiplication?

0 votes
0 answers
37 views

Can a RAM machine with polynomial memory be simulated by a multi-tape Turing machine without extra time or space costs?

-1 votes
0 answers
23 views

Big O of evaluating expression under RAM model

1 vote
0 answers
17 views

On generating tight instances of Max Cover / NP-hard Problems

3 votes
0 answers
66 views

References for $\mathsf{PSPACE} \neq \mathsf{E}$ and $\mathsf{P} \neq \mathsf{NTIME}(n^k)$

-1 votes
0 answers
31 views

Applying $/mu$-Operator for Unbounded minimization

2 votes
1 answer
88 views

Classical Fourier analysis for the nonabelian hidden subgroup problem

4 votes
1 answer
185 views

Complexity of permutation group intersection

5 votes
2 answers
232 views

What are the computations model with a constant slowdown ? (and why do we care about Turing machines)

3 votes
0 answers
93 views
+50

Collapse of query and oracle hierarchies

2 votes
0 answers
75 views

Multipoint evaluation in Lagrange basis

7 votes
1 answer
244 views

Is parity of GI easy?

10 votes
1 answer
330 views

Is there a planar 4-regular graph that is 3-acyclic colourable?

Browse more Questions