NP-complete

Results: 1728



#Item
431Complexity classes / Circuit complexity / Computability theory / Mathematical optimization / FO / NP-complete / P versus NP problem / Time complexity / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2006-11-19 23:12:18
432NP-complete problems / Analysis of algorithms / Graph coloring / Parameterized complexity / Complexity classes / Kernelization / Time complexity / Clique problem / Vertex cover / Theoretical computer science / Computational complexity theory / Graph theory

Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-09-04 05:57:59
433Spanning tree / NP-complete problems / Combinatorial optimization / Operations research / Minimum spanning tree / Routing algorithms / Algorithm / Matching / Dynamic programming / Mathematics / Theoretical computer science / Graph theory

ICS 161 — Algorithms — Winter 1998 — Second Midterm Name: ID:

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 1998-11-13 18:59:53
434NP-complete problems / Analysis of algorithms / Parameterized complexity / Complexity classes / Kernelization / Dominating set / Feedback vertex set / Michael Fellows / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics

Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-09-04 05:58:10
435Topological graph theory / Graph drawing / NP-complete problems / Geometric graph theory / Graph embedding / Planar graph / Graph coloring / Force-based algorithms / Graph / Graph theory / Mathematics / Theoretical computer science

Curriculum Vitae Stephen G. Kobourov Department of Computer Science University of Arizona, Tucson AZWeb: http://www.cs.arizona.edu/˜kobourov Email:

Add to Reading List

Source URL: www.cs.arizona.edu

Language: English - Date: 2015-04-13 15:56:42
436Combinatorics / Graph theory / NP-complete problems / Conjectures / Mathematics / Fibonacci numbers / Theoretical computer science

CS 373 Homework 5 (dueSpring 1999

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:54:11
437Mathematics / Dominating set / Unit disk graph / Independent set / APX / Approximation algorithm / Vertex cover / Planar separator theorem / Theoretical computer science / Graph theory / NP-complete problems

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
438Complexity classes / NP-complete problems / Mathematical optimization / NP-complete / Computational problems / P versus NP problem / NP / Decision problem / Clique problem / Theoretical computer science / Computational complexity theory / Applied mathematics

Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1

Add to Reading List

Source URL: www.asiapacific-mathnews.com

Language: English - Date: 2014-02-27 03:55:07
439NP-complete problems / Spanning tree / Steiner tree problem / Minimum spanning tree / Time complexity / Approximation algorithm / Rectilinear Steiner tree / Theoretical computer science / Graph theory / Computational complexity theory

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:29:08
440Planar graphs / Eulerian path / Clique / Tree / Connectivity / Graph / Edge coloring / Hamiltonian path / Graph theory / Graph coloring / NP-complete problems

Name: ID: ICS 163 — Graph Algorithms — Winter 1994 — Final

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2006-04-27 18:46:37
UPDATE