exfret's user avatar
exfret's user avatar
exfret's user avatar
exfret
  • Member for 7 years, 10 months
  • Last seen more than a week ago
2 votes
0 answers
85 views

Result showing that DTIME[T] is strictly contained in random-access NTIME[T]

1 vote
0 answers
42 views

Efficient algorithm for finding segregators in a directed acyclic graph

5 votes
0 answers
227 views

What research is being done in classical complexity theory?

8 votes
2 answers
323 views

Lower bound on pebbling numbers

2 votes
0 answers
130 views

What is the communication complexity of approximating addition?

2 votes
0 answers
73 views

Complexity of comparing extended integer power towers

8 votes
2 answers
665 views

Are all turing machines paths predictable?

3 votes
0 answers
190 views

Is $SUBLOG\subset DTIME(n)$?

4 votes
0 answers
274 views

Is $L\subset NC^1$

7 votes
2 answers
386 views

Are space and time hierarchies even comparable?

5 votes
1 answer
208 views

Turing machines over a structure