User Dan Brumleve - Theoretical Computer Science Stack Exchange

Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.

Dan Brumleve

Member for 11 years
Last seen more than 3 years ago

math.stackexchange.com/users/…
Champaign, IL

5 Questions

Score Activity Newest Views

7 votes

1 answer

355 views

Examples of quasilinear vs. essentially linear time translatable models

reference-request time-complexity machine-models

asked Nov 21, 2017 at 16:25

7 votes

2 answers

390 views

Most general setting for fine-grained exponential-time complexity classes?

reference-request time-complexity exp-time-algorithms machine-models

asked Nov 29, 2017 at 19:56

4 votes

0 answers

273 views

The problem of whether or not every function computable in time $T(n)$ is computable in time $T(n)^{O(1)}$ and space $T(n)^{o(1)}$ simultaneously

reference-request time-complexity space-complexity

asked Dec 1, 2017 at 6:54

4 votes

0 answers

66 views

Complexity of comparing polygon perimeters

cc.complexity-theory tsp

asked Mar 18, 2018 at 18:37

1 vote

2 answers

375 views

What is the time complexity of base conversion on a multi-tape Turing machine?

reference-request time-complexity turing-machines

asked Nov 20, 2017 at 18:45