Reputation
678
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
1 5 12
Newest
 Yearling
Impact
~8k people reached

Aug
24
revised Can CNF Hamiltonian graphs be turned to “DNF” graphs?
further elaboration
Aug
24
comment Can CNF Hamiltonian graphs be turned to “DNF” graphs?
Generating all subsets of |V| - 1 edges. CNF to DNF can be accomplished with a similarly exhaustive process: choosing a single literal from each CNF clause and combining them to create a DNF clause, then iterating this process with different literals until all possible DNF clauses have been created.
Aug
24
revised Can CNF Hamiltonian graphs be turned to “DNF” graphs?
a little more elaboration
Aug
22
revised Can CNF Hamiltonian graphs be turned to “DNF” graphs?
added missing word
Aug
22
revised Can CNF Hamiltonian graphs be turned to “DNF” graphs?
typo fix
Aug
22
answered Can CNF Hamiltonian graphs be turned to “DNF” graphs?
Aug
6
revised Why is it that if one NP complete problem is solved, all NP problems are solved?
all NP problems aren't the same, all NP-complete problems are.
Aug
6
suggested approved edit on Why is it that if one NP complete problem is solved, all NP problems are solved?
Jul
23
revised Must an algorithm that decides a problem in NP also produce a solution?
phrasing
Jul
23
answered Must an algorithm that decides a problem in NP also produce a solution?
Jul
7
awarded  Yearling
Jul
7
answered Is it known whether a hypothetical P-time NP-complete decision procedure has to find a specific solution to the given constraint satisfaction problem?
Jul
7
answered Why doesn't the decision problem for Presburger arithmetic demonstrate that $\mathsf{P} \neq \mathsf{NP}$
Jun
23
comment Reorder adjacency matrices of regular graphs so they are the same
Two questions: How is the matrix E created? What definition of permutation are you using? If two strings equal length strings consisting of zeroes and ones only have the same number of ones in them, then the strings are permutable to each other under the definition of permutation I'm familiar with.
May
31
answered Is bipartite maximal matching an NP Hard or NP Complete or neither?
May
15
revised Proving that Unit Intersection is NP-complete
mathjaxed some variables, boldfaced problem names
May
15
revised Proving UNIT INTERSECTION NP-complete
mathjaxed some variables, boldfaced problem names
May
15
answered Proving UNIT INTERSECTION NP-complete
May
15
suggested approved edit on Proving that Unit Intersection is NP-complete
May
15
suggested approved edit on Proving UNIT INTERSECTION NP-complete