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
Super0
Unregistered
  • Member for 8 years, 8 months
  • Last seen more than 8 years ago
  • Meta user
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bookmarks
  • Bounties
  • Reputation
  • All actions

8 Answers

Score Activity Newest
8 votes

NP-hard problems on paths

graph-theory np-hardness
answered Feb 4, 2014 at 14:49
2 votes

Complexity of topological sort with constrained positions

sorting directed-acyclic-graph partial-order order-theory topological-sorting
answered Sep 19, 2013 at 13:56
2 votes

Proof for ACYCLIC PARTITION being NP-complete

graph-theory approximation-algorithms np-complete
answered Mar 1, 2014 at 11:28
2 votes

Is there a non Turing-complete model of computation whose halting problem is undecidable?

automata-theory computability turing-machines lambda-calculus universal-computation
answered Mar 28, 2014 at 0:07
1 vote

Turing-complete computation models on graphs

reference-request graph-theory graph-algorithms computability
answered Mar 28, 2014 at 18:44
1 vote

Maximum matching versus preferential assignment

multicommodity-flow
answered Apr 16, 2014 at 19:51
0 votes

Complexity of ambiguous parsing?

string-matching
answered Apr 2, 2014 at 18:50
-2 votes

Algorithms from the Book.

ds.algorithms soft-question ds.data-structures big-list
answered Feb 26, 2014 at 15:02
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.19.42176

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.