Ankur

Member for 9 years, 8 months
Last seen more than 3 years ago

sites.google.com/site/…
Illinois

Network profile

Reputation

779

779

2018
2019
2020
2021

Top tag

ds.algorithms

Next privilege

1,000 Rep.

See votes

Badges

4

13

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

3 helpful flags

20 votes cast

4 Answers

Votes Activity Newest

5

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

Apr 23 '12 at 15:15

4

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

Apr 12 '12 at 17:44

2

Primal vs dual decomposition methods

May 3 '12 at 23:27

2

Linear Programming with Modulo Linear Constraints

Apr 21 '12 at 20:30

Theoretical Computer Science Stack Exchange works best with JavaScript enabled