Dan Brumleve

Member for 11 years, 1 month
Last seen more than 3 years ago

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

Summary

Reputation

560

560
515
470

2019
2020
2021
2022

Top tag

cc.complexity-theory

Next privilege

1,000 Rep.

See votes

Badges

5

17

Newest

Caucus

Next badge

0/1

Informed

Answers

View all 9 answers

Score Activity Newest

18

Is there a natural problem on the naturals that is NP-complete?

Jan 31, 2017

13

Is the integer factorization problem harder than RSA factorization: $n = pq$?

May 28, 2011

7

Can we not output the Kolmogorov complexity?

Feb 9, 2016

4

Random sampling data structure with removal

Feb 27, 2017

3

Natural NP-complete problems with high density?

Nov 25, 2015

Questions

Score Activity Newest Views

7

Examples of quasilinear vs. essentially linear time translatable models

Nov 21, 2017

7

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

Nov 29, 2017

4

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

Dec 1, 2017

4

Complexity of comparing polygon perimeters

Mar 18, 2018

1

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

Nov 20, 2017

Tags

View all 27 tags

cc.complexity-theory

41

Score

5

posts

np-hardness

31

Score

2

posts

combinatorial-game-theory

18

Score

1

post

nt.number-theory

18

Score

1

post

cr.crypto-security

15

Score

2

posts

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

This user doesn’t have any gold badges yet.

5

silver badges

Enthusiast

Feb 24, 2016
Necromancer

× 2

Jan 31, 2017
Yearling

× 2

Jan 31, 2017

17

bronze badges

Explainer

Sep 30, 2014
Benefactor

Nov 27, 2017
Organizer

May 28, 2011

Bookmarks

View all 8 bookmarks

Score Activity Newest Views Added

38

Extended Church-Turing Thesis

Jul 27, 2011

31

Is there a natural problem on the naturals that is NP-complete?

Oct 30, 2012

28

Can we not output the Kolmogorov complexity?

Apr 26, 2015

18

Is it possible to encrypt a CNF?

Dec 29, 2017

13

Reference for Levin's optimal factoring algorithm ?

Apr 28, 2011

Accounts

View all 22 accounts

17.3k
6
44
96

2,144
15
27

594
3
9

Theoretical Computer Science

560
5
17

438
1
4
19

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

111

upvotes

3

downvotes

60

question votes

54

answer votes