Polynomial-time reduction - PDFSEARCH.IO - Document Search Engine

Polynomial-time reduction
Results: 20

#	Item
1	The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2003-12-08 11:12:51 Computational complexity theory Theory of computation Mathematics Complexity classes Computational problems Theoretical computer science Structural complexity theory Tutte polynomial NP Quantum computing Time complexity Reduction
2	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
3	Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-08-04 00:47:22 Computer algebra Computational complexity theory Polynomials Algebra Factorization of polynomials Polynomial Time complexity Reduction Polynomial greatest common divisor Factorization of polynomials over finite fields
4	February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-04 17:20:26 Computational complexity theory Complexity classes Theory of computation Polynomial hierarchy P versus NP problem IP True quantified Boolean formula NP PP Oracle machine PSPACE-complete Polynomial-time reduction
5	POLYNOMIAL-TIME DATA REDUCTION FOR THE SUBSET INTERCONNECTION DESIGN PROBLEM† JIEHUA CHEN‡ , CHRISTIAN KOMUSIEWICZ‡ , ROLF NIEDERMEIER‡ , ˇ ´ § , AND MATHIAS WELLER¶ MANUEL SORGE‡ , ONDREJ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-10-07 07:43:25
6	On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL) Add to Reading List Source URL: www.cs.swan.ac.uk Language: English - Date: 2015-05-05 07:12:16 Complexity classes Proof theory Structural complexity theory Curry–Howard correspondence Type theory NP Time complexity Reduction Linear logic Theoretical computer science Computational complexity theory Applied mathematics
7	On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2008-12-08 14:23:03 Complexity classes Polynomial Advice P Reduction Time complexity Bounded-error probabilistic polynomial Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics
8	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics
9	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory