Stack Exchange Network

Stack Exchange network consists of 180 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
  1. 0
  2. +0
    • Tour Start here for a quick overview of the site
    • Help Center Detailed answers to any questions you might have
    • Meta Discuss the workings and policies of this site
    • About Us Learn more about Stack Overflow the company
    • Business Learn more about our products
  3. current community

    • Theoretical Computer Science
      help chat
    • Theoretical Computer Science Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
  4. Log in
  5. Sign up
Theoretical Computer Science
  1. Home
    1. Public
    2. Questions
    3. Tags
    4. Users
    5. Companies
    6. Unanswered
    1. Teams
      Stack Overflow for Teams – Start collaborating and sharing organizational knowledge. Create a free Team Why Teams?
    2. Teams
    3. Create free Team

Teams

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Learn more
user avatar
user avatar
user avatar
Dan Brumleve
  • Member for 11 years
  • Last seen more than 3 years ago
  • math.stackexchange.com/users/…
  • Champaign, IL
  • Meta user
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bookmarks
  • Bounties
  • Reputation
  • All actions

5 Questions

Score Activity Newest Views
4 votes
0 answers
66 views

Complexity of comparing polygon perimeters

cc.complexity-theory tsp
asked Mar 18, 2018 at 18:37
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
7 votes
2 answers
389 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
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
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
Theoretical Computer Science
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2022 Stack Exchange Inc; user contributions licensed under cc by-sa. rev 2022.5.20.42186

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.