- Theoretical Computer Science 1.6k 1.6k 11 gold badge1717 silver badges2828 bronze badges
- Computer Science 629 629 66 silver badges1515 bronze badges
- Operations Research 504 504 44 silver badges1212 bronze badges
- Mathematics 203 203 11 silver badge88 bronze badges
- Personal Finance & Money 183 183 55 bronze badges
- View network profile
Top network posts
- 27 Reasons to believe $P \ne NP \cap coNP$ (or not)
- 15 How can a problem be in NP, be NP-hard and not NP-complete?
- 15 Linear-time algorithm to test if clique number equals degeneracy bound?
- 15 What instances can be solved today by modern solvers (pure LP)?
- 14 What is complexity of this max-edge subgraph problem?
- 14 Algorithms for finding clique in bounded-degree graph
- 14 Parameterized complexity from P to NP-hard and back again
- View more network posts →