User contributions for Emichael

12 November 2012

• 04:0804:08, 12 November 2012 diff hist +522‎ Talk:Traveling Salesman Problem is NP-Complete ‎No edit summary

21 September 2011

• 16:0616:06, 21 September 2011 diff hist +885‎ Talk:Traveling Salesman Problem is NP-Complete ‎No edit summary

15 June 2011

• 22:3822:38, 15 June 2011 diff hist +92‎ Existence of Uncomputable Mappings ‎No edit summary
• 21:4121:41, 15 June 2011 diff hist +2‎ m Existence of Uncomputable Mappings ‎No edit summary
• 21:4021:40, 15 June 2011 diff hist +906‎ N Existence of Uncomputable Mappings ‎ Created page with "== Theorem == There exists a function that is not computable. == Proof == [[Every_Turing_Machine_can_be_Represented_as_a_Binary_String.|Every Turing Machine can be Represente..."

5 June 2011

• 02:5902:59, 5 June 2011 diff hist +18‎ Traveling Salesman Problem ‎No edit summary
• 02:5602:56, 5 June 2011 diff hist +4,155‎ N Traveling Salesman Problem is NP-Complete ‎ Created page with "== Problem Statement == There are two versions of the Traveling Salesman Problem. The function version: :Given a complete weighted graph $G$ with positive integer weights find a..."

4 June 2011

• 17:5017:50, 4 June 2011 diff hist −4‎ m Directed Hamilton Cycle Problem is NP-complete ‎ →‎The Function Version of the Problem is Reducible to the Decision Version of the Problem
• 08:3108:31, 4 June 2011 diff hist +6,261‎ N Directed Hamilton Cycle Problem is NP-complete ‎ Created page with "== Problem == There are two versions of the Directed Hamilton Cycle Problem. The function version: : Given a directed graph $G$ with $n$ vertices find a Hamilton Cycle in $G$. ..."
• 07:3707:37, 4 June 2011 diff hist 0‎ File:CNF to HAMILTONIAN graph2.jpg ‎ uploaded a new version of "File:CNF to HAMILTONIAN graph2.jpg" current
• 07:3607:36, 4 June 2011 diff hist 0‎ N File:CNF to HAMILTONIAN graph2.jpg ‎No edit summary
• 07:1207:12, 4 June 2011 diff hist +129‎ N File:CNF to HAMILTONIAN graph.jpg ‎ A homemade picture illustrating the structure of a graph used in the proof that Directed Hamiltonian Cycle problem is NP-complete current
• 06:2506:25, 4 June 2011 diff hist −5‎ m CNF Satisfiability Problem is NP-Complete ‎ →‎Binary Functions
• 00:2100:21, 4 June 2011 diff hist +498‎ User talk:Lord Farin/Backup/Help:Editing/House Style ‎No edit summary

2 June 2011

• 17:3317:33, 2 June 2011 diff hist +173‎ User talk:Lord Farin/Backup/Help:Editing/House Style ‎ →‎The d of Calculus
• 07:2107:21, 2 June 2011 diff hist +83‎ m CNF Satisfiability Problem is NP-Complete ‎No edit summary
• 07:1807:18, 2 June 2011 diff hist +3‎ m CNF Satisfiability Problem is NP-Complete ‎No edit summary
• 07:1607:16, 2 June 2011 diff hist +1,560‎ CNF Satisfiability Problem is NP-Complete ‎No edit summary
• 05:5605:56, 2 June 2011 diff hist +47‎ m Talk:CNF Satisfiability Problem is NP-Complete ‎No edit summary
• 05:5505:55, 2 June 2011 diff hist +1‎ m Talk:CNF Satisfiability Problem is NP-Complete ‎No edit summary
• 05:5505:55, 2 June 2011 diff hist +753‎ Talk:CNF Satisfiability Problem is NP-Complete ‎No edit summary
• 04:4804:48, 2 June 2011 diff hist 0‎ Cook-Levin Theorem ‎No edit summary
• 04:3204:32, 2 June 2011 diff hist +29‎ CNF Satisfiability Problem is NP-Complete ‎No edit summary
• 04:3104:31, 2 June 2011 diff hist +4,126‎ N CNF Satisfiability Problem is NP-Complete ‎ Created page with "== Theorem == The Conjunctive Normal Form Boolean Satisfiability Problem (Abbreviated as CNF SAT) is NP-complete. == Proof == === CNF SAT is NP === Given a CNF SAT problem a ..."

1 June 2011

• 21:4921:49, 1 June 2011 diff hist +91‎ Definition:CNF Satisfiability Problem ‎No edit summary
• 21:4021:40, 1 June 2011 diff hist +625‎ N Definition:CNF Satisfiability Problem ‎ Created page with "== Problem == A '''Conjunctive Normal Form Boolean Satisfiability problem''' is a Boolean Satisfiability problem where all the clauses in $L$ a..."
• 16:4816:48, 1 June 2011 diff hist +49‎ Definition:Boolean Satisfiability Problem ‎No edit summary
• 16:2716:27, 1 June 2011 diff hist +75‎ Definition:Boolean Satisfiability Problem ‎No edit summary

31 May 2011

• 05:1505:15, 31 May 2011 diff hist +62‎ Cook-Levin Theorem ‎No edit summary
• 04:4004:40, 31 May 2011 diff hist +2‎ m Cook-Levin Theorem ‎No edit summary
• 04:3904:39, 31 May 2011 diff hist +2‎ m Cook-Levin Theorem ‎No edit summary
• 04:3804:38, 31 May 2011 diff hist +4,813‎ N Cook-Levin Theorem ‎ Created page with "== Theorem == The Boolean Satisfiability Problem is NP-Complete. == Proof == === The Boolean Satisfiability Probl..."

30 May 2011

• 19:4519:45, 30 May 2011 diff hist +79‎ Definition:Boolean Satisfiability Problem ‎No edit summary

28 May 2011

• 21:2921:29, 28 May 2011 diff hist +132‎ Definition:NP Complexity Class ‎No edit summary
• 21:1921:19, 28 May 2011 diff hist +278‎ N Definition:NP-Complete ‎ Created page with "== Definition == A problem "$L$" is NP-complete if any problem in the class NP can be reduced in polynomial time and space to $L$. {{stub}} [[Category:Defini..."
• 21:1021:10, 28 May 2011 diff hist +160‎ Definition:NP Complexity Class ‎No edit summary
• 21:0421:04, 28 May 2011 diff hist +743‎ N Definition:NP Complexity Class ‎ Created page with "== Definition == In computation theory NP is a complexity class where there exists some Nondeterministic Turing Machine that will ..."
• 20:0420:04, 28 May 2011 diff hist +2‎ Definition:Nondeterministic Turing Machine ‎No edit summary

11 May 2011

• 02:5002:50, 11 May 2011 diff hist 0‎ Definition:Boolean Satisfiability Problem ‎No edit summary
• 02:4902:49, 11 May 2011 diff hist +449‎ N Definition:Boolean Satisfiability Problem ‎ Created page with "Given a set of binary boolean variables $X$ and a list of one or more logical expresions $L$ find values for all $x \in X$ such that all the expre..."

2 May 2011

• 20:3620:36, 2 May 2011 diff hist +281‎ Definition:Big-Omega Notation ‎ Adding little omega to page