Theoretical Computer Science
Regularity's user avatar
Regularity's user avatar
Regularity's user avatar
Regularity
  • Member for 13 years, 3 months
  • Last seen more than a week ago
Profile Activity
Stats
901
reputation
9k
reached
1
answer
7
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
13
bronze badges
Top tags
View all tags
1
Score
1
Posts
12
Posts %
1
Score
1
Posts
12
Posts %
0
Score
4
Posts
50
Posts %
0
Score
3
Posts
38
Posts %
0
Score
2
Posts
25
Posts %
0
Score
2
Posts
25
Posts %
Top posts
All Questions Answers
Score Newest
question
24
What is the best exact algorithm to compute the core of a graph?
Nov 5, 2010
question
16
Any references for techniques in FPT reductions?
Feb 13, 2011
question
12
Any results on binary boolean CSP beyond the fixed-parameter tractability of almost 2SAT problem?
Jul 18, 2011
question
11
Is 0-1 programming with constant number of constraints polynomially solvable?
May 22, 2012
question
5
Is there any natural Karp reduction from Independent Set problem to SAT?
Aug 26, 2010
question
5
Any relation between the size of maximum independent set and the chromatic number on graph of bounded degree?
Jun 12, 2011
question
5
What is the parameterized complexity of following model checking problem?
Jan 12, 2011
answer
1
Directed NP-hard problems on DAGs
Oct 5, 2010

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.