NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
91	Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:24 Computational complexity theory Graph theory Mathematics NP-complete problems Combinatorial optimization NP-hard problems Graph coloring Signal-to-interference-plus-noise ratio NC Open set Independent set Matching
92	Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction Add to Reading List Source URL: fm.csl.sri.com Language: English - Date: 2010-10-30 02:14:08 Theoretical computer science Formal methods Logic in computer science Electronic design automation NP-complete problems Boolean algebra Boolean satisfiability problem Solver Formal equivalence checking Formal verification Model checking Uclid
93	Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2014-01-31 12:40:59 Graph theory NP-complete problems Circular-arc graph Hamiltonian path Intersection graph Graph Path Interval graph Chordal graph Indifference graph Longest path problem Split graph
94	КЛУБ ЛОГИКА CLUB LOGIKA КЛУБ ЛОГИКА CLUB LOGIKA Add to Reading List Source URL: www.wscwpc2015.org Language: English - Date: 2015-10-13 19:05:35 Logic puzzles NP-complete problems Pole vault at the Olympics Hitori High jump at the Olympics Athletics at the 2012 Summer Olympics
95	Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-08-17 14:43:26 Graph theory Mathematics Algebra Algebraic graph theory Matrices NP-complete problems Eigenvalues and eigenvectors Linear algebra Singular value decomposition Paley graph Adjacency matrix Matrix
96	Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-09-25 06:28:22 Graph theory Mathematics NP-complete problems Combinatorial optimization Graph connectivity Graph coloring Graph Matching Triadic closure Clique problem Vertex cover Clique
97	A method for finding the maximal set in excess demand Add to Reading List Source URL: erlanson.weebly.com Language: English - Date: 2016-05-25 09:51:01 Auction theory Competition Competitive equilibrium Market Game theory Mathematics NP-complete problems
98	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
99	DOUGLAS BAUER Professor Mathematical Sciences Department Stevens Institute of Technology EDUCATION Ph.D., Stevens Institute of Technology, 1978 Add to Reading List Source URL: personal.stevens.edu Language: English - Date: 2011-06-27 08:31:04 Graph theory NP-complete problems Extremal graph theory Line graph Cubic graph Graph Cycle Regular graph Hamiltonian path
100	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut

UPDATE