Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs
exfret's user avatar
exfret's user avatar
exfret's user avatar
exfret
  • Member for 7 years, 11 months
  • Last seen more than a month ago
8 votes
2 answers
667 views

Are all turing machines paths predictable?

8 votes
2 answers
327 views

Lower bound on pebbling numbers

7 votes
2 answers
393 views

Are space and time hierarchies even comparable?

5 votes
0 answers
229 views

What research is being done in classical complexity theory?

5 votes
1 answer
208 views

Turing machines over a structure

4 votes
0 answers
278 views

Is $L\subset NC^1$

3 votes
0 answers
190 views

Is $SUBLOG\subset DTIME(n)$?

2 votes
0 answers
73 views

Complexity of comparing extended integer power towers

2 votes
0 answers
130 views

What is the communication complexity of approximating addition?

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