NP-hardness - PDFSEARCH.IO - Document Search Engine

NP-hardness
Results: 35

#	Item
21	On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:57:00 Analysis of algorithms Time complexity Polynomials NP Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
22	How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡ Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 1998-12-21 18:16:27 Complexity classes Mathematical optimization NP-complete problems Combinatorial optimization Approximation algorithm NP-complete Hardness of approximation Optimization problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
23	Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-04-25 00:45:46 NP-complete problems Operations research Combinatorial optimization Travelling salesman problem Cubic graph Hamiltonian path Gadget Degree Regular graph Graph theory Theoretical computer science Mathematics
24	Hardness of Set Cover with Interse tion 1 V.S.Anil Kumar1 , Sunil Arya2 and H.Ramesh3 MPI fur Informatik, Saarbru ken. kumarmpi-sb.mpg.de Department of Computer S ien e, Hong Kong University of S ien e and Te hnology. Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:28:02 NP-complete problems Set cover problem Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
25	Introduction Parameterized Algorithms Parameterized Hardness Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-13 19:09:20 NP-complete problems Graph coloring Connectivity Graph Topology Graph theory Theoretical computer science Mathematics
26	MQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems ⋆ Takanori Yasuda1 , Xavier Dahan1,6 , Yun-Ju Huang1,2 , Tsuyoshi Takagi1,3,4 , and Kouichi Sakurai1,5 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-03-26 06:14:31 Algebraic geometry QUAD Polynomials Hidden Field Equations XTR System of polynomial equations Quadratic NP XSL attack Mathematics Finite fields Post-quantum cryptography
27	Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2006-04-11 06:21:40 NP-complete problems Vertex cover Independent set NP-complete NP PCP theorem Maximal independent set Power set P versus NP problem Theoretical computer science Mathematics Computational complexity theory
28	The Tale of the PCP Theorem How the search for the limits of computing led to the discovery of the unexpected power of proofs Dana Moshkovitz, MIT Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-04-12 18:03:28 Probabilistic complexity theory Complexity classes Mathematical optimization Probabilistically checkable proof PCP theorem NP NEXPTIME Hardness of approximation P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
29	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 NP-complete problems Probabilistic complexity theory Mathematical optimization Complexity classes PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
30	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 09:39:33 Computational complexity theory NP-complete problems Probabilistic complexity theory PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof NP Clique Theoretical computer science Applied mathematics Mathematics

UPDATE