Co-NP-complete - PDFSEARCH.IO - Document Search Engine

Co-NP-complete
Results: 26

#	Item
21	CURRICULUM VITAE Joan P. Hutchinson PO Box 2567, Silverthorne CO[removed]Macalester College, Professor emerita Tel[removed]e-mail: [removed] Add to Reading List Source URL: www.macalester.edu Language: English - Date: 2013-10-31 22:38:13 NP-complete problems Graph coloring Combinatorics Journal of Graph Theory Minor Graph Bipartite graph Planar graph Martin Charles Golumbic Graph theory Mathematics Theoretical computer science
22	Bibliography Joan P. Hutchinson Macalester College, Professor emerita PO Box 2567, Silverthorne CO[removed]Tel[removed]e-mail: [removed] Add to Reading List Source URL: www.macalester.edu Language: English - Date: 2013-11-14 16:29:03 Graph coloring NP-complete problems Minor Combinatorics Arboricity Algebraic graph theory Martin Charles Golumbic Graph equation Graph theory Mathematics Theoretical computer science
23	Local resilience of graphs arXiv:0706.4104v2 [math.CO] 1 Dec 2007 Benny Sudakov Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-02-04 22:30:50 Extremal graph theory Random graphs Connectivity Matching NP-complete problems Graph Neighbourhood Clique Line graph Graph theory Mathematics Graph coloring
24	P , NP and mathematics – a computational complexity perspective Avi Wigderson Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:58:44 Complexity classes P versus NP problem Co-NP NP P Decision problem Time complexity Reduction NP-complete Theoretical computer science Computational complexity theory Applied mathematics
25	i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:00:26 Complexity classes NP P versus NP problem Cook–Levin theorem P Boolean satisfiability problem Reduction Time complexity Co-NP-complete Theoretical computer science Computational complexity theory Applied mathematics
26	PDF Document Add to Reading List Source URL: ling.umd.edu Language: English - Date: 2009-08-01 00:43:08 Applied mathematics NP-complete Optimality theory NP-hard NP Hamiltonian path problem Complete Strongly NP-complete Co-NP Theoretical computer science Computational complexity theory Complexity classes

UPDATE