NP-hardness - PDFSEARCH.IO - Document Search Engine

NP-hardness
Results: 35

#	Item
1	On Basing One-Way Functions on NP-Hardness Adi Akavia Oded Goldreich MIT Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2007-08-16 15:49:05
2	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:25 Computational complexity theory Complexity classes NP-complete problems Operations research Combinatorial optimization Mathematical optimization Knapsack problem Reduction Graph coloring NP-hardness NP Optimization problem
3	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
4	On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira Add to Reading List Source URL: www.dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:56 Theory of computation Complexity classes Mathematics Theoretical computer science Valuation Submodular set function NC NP Reduction P/poly
5	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
6	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:20 Computational problems NP-complete problems Optimization problem Synteny Independent set
7	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:55 Complexity classes NP-hardness NP P versus NP problem Computational complexity theory P Reduction
8	QCSP on partially reflexive forests Barnaby Martin Algorithms and Complexity in Durham, Durham University, U.K. CP 2011, Perugia. 14th August 2011. Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-09-13 17:39:08 Complexity classes NP-hardness IP PSPACE-complete NP Reduction PSPACE P FO Circuits over sets of natural numbers True quantified Boolean formula
9	Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-05-08 17:50:59 Complexity classes Computational complexity theory Advice PP P/poly ArthurMerlin protocol Pseudorandom generator Randomized algorithm NP IP Extractor ACC0
10	RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering Add to Reading List Source URL: grk1855.tu-dortmund.de Language: English - Date: 2015-06-25 08:55:11 Computational complexity theory Theory of computation Combinatorial optimization Complexity classes Operations research Integer programming Heuristic Branch and bound NP Optimization problem Pruning Reduction