Stack Exchange Network

Stack Exchange network consists of 181 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
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 about Teams
Ankur's user avatar
Ankur's user avatar
Ankur's user avatar
Ankur
  • Member for 10 years, 10 months
  • Last seen more than 5 years ago
  • sites.google.com/site/…
  • Illinois
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bounties
  • Reputation
  • All actions

4 Answers

Score Activity Newest
5 votes

What classes of mathematical programs can be solved exactly or approximately, in polynomial time?

  • ds.algorithms
  • optimization
  • linear-programming
  • semidefinite-programming
  • polynomial-time
answered Apr 23, 2012 at 15:15
4 votes

Complexity of finding if a degree bounded graph H is a subgraph of an unbounded graph G

  • cc.complexity-theory
  • graph-theory
  • graph-isomorphism
  • bounded-degree
answered Apr 12, 2012 at 17:44
2 votes

Linear Programming with Modulo Linear Constraints

  • ds.algorithms
  • graph-theory
  • graph-algorithms
  • optimization
  • linear-programming
answered Apr 21, 2012 at 20:30
2 votes

Primal vs dual decomposition methods

  • ds.algorithms
  • optimization
  • primal-dual
  • convex-optimization
  • intuition
answered May 3, 2012 at 23:27
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 © 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2023.2.8.43227

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.