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…
    • 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
  1. 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
  2. Log in
  3. Sign up
Results from the 2022 Developer Survey are now available
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
argentpepper
  • Member for 11 years, 3 months
  • Last seen more than 2 years ago
  • Meta user
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bookmarks
  • Bounties
  • Reputation
  • All actions

6 Answers

Score Activity Newest
27 votes

What are the consequences of $\mathsf{L}^2 \subseteq \mathsf{P}$?

cc.complexity-theory complexity-classes conditional-results structural-complexity
answered Nov 2, 2015 at 16:39
4 votes

Finding the sparsest solution to a system of linear equations

np-hardness linear-algebra linear-programming matrices sparse-matrix
answered Dec 16, 2015 at 16:07
4 votes

Hardest problems to approximate

approximation-hardness clique
answered Jun 10, 2013 at 17:44
3 votes

Problems in $\text{PSPACE} \cap \text{Co-NP-Hard}$

cc.complexity-theory complexity-classes
answered Sep 4, 2014 at 18:04
2 votes

How big is NSC^k?

cc.complexity-theory space-bounded nondeterminism
answered Jan 30, 2013 at 0:14
1 vote

In what class are randomized algorithms that err with exactly 25% chance?

cc.complexity-theory complexity-classes randomized-algorithms
answered Dec 6, 2013 at 22:22
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.6.24.42450

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.