Reputation
914
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
1 7 12
Newest
 Yearling
Impact
~21k people reached

Apr
21
answered Reducing graph 3-coloring to 10-coloring
Mar
28
answered Complement of SEMIPRIME is in NP
Mar
28
answered Time Complexity of DFS
Feb
23
comment On a subset sum version.
I don't understand the approximation part of the question. What would you be approximating?
Feb
23
revised On a subset sum version.
tweaked phrasing
Feb
20
revised On a subset sum version.
shows the reduction from EXACT COVER to the proposed problem
Feb
20
awarded  Yearling
Feb
20
answered On a subset sum version.
Jan
29
revised How is $ BPP = BPP_{1/2+n^{-c}}= BPP_{1-2^{n^{-d}}} $
added a few missing words
Dec
23
comment Formula for all possible sums of a binary sequence
What do you mean by "compact formula"?
Dec
14
answered A query about reducting SAT to 3SAT when there are more than 3 literals in a clause
Nov
23
answered Can any NP-Complete problem can be reduced to any other NP-Complete problem in polynomial time?
Nov
16
revised How is $ BPP = BPP_{1/2+n^{-c}}= BPP_{1-2^{n^{-d}}} $
linked BPP to the complexity zoo, punctuation and phrasing fix
Nov
8
revised How is $ BPP = BPP_{1/2+n^{-c}}= BPP_{1-2^{n^{-d}}} $
removed irrelevant np-complete tag, added algorithms, made title contain the question
Nov
8
suggested approved edit on How is $ BPP = BPP_{1/2+n^{-c}}= BPP_{1-2^{n^{-d}}} $
Nov
8
suggested rejected edit on How is $ BPP = BPP_{1/2+n^{-c}}= BPP_{1-2^{n^{-d}}} $
Nov
8
answered How is $ BPP = BPP_{1/2+n^{-c}}= BPP_{1-2^{n^{-d}}} $
Oct
12
awarded  Necromancer
Oct
7
revised Trouble understanding why Disjunctive Normal Form is polynomial time solvable but not CNF.
additional clarity
Oct
7
suggested approved edit on Trouble understanding why Disjunctive Normal Form is polynomial time solvable but not CNF.