1![The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford](https://www.pdfsearch.io/img/fef5a707b529a3d59afb18abbddd0dfb.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2003-12-08 11:12:51
|
---|
2![Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1](https://www.pdfsearch.io/img/0912a2aa31bc230cf833a2a358d15e62.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2016-01-03 06:44:56
|
---|
3![Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech](https://www.pdfsearch.io/img/28e6007f96988756351faf53807b4a11.jpg) | Add to Reading ListSource URL: users.cms.caltech.eduLanguage: English - Date: 2008-08-04 00:47:22
|
---|
4![February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass](https://www.pdfsearch.io/img/e0e7428bc0eed683b18c231202185894.jpg) | Add to Reading ListSource URL: www.cs.cornell.eduLanguage: English - Date: 2009-02-04 17:20:26
|
---|
5![POLYNOMIAL-TIME DATA REDUCTION FOR THE SUBSET INTERCONNECTION DESIGN PROBLEM† JIEHUA CHEN‡ , CHRISTIAN KOMUSIEWICZ‡ , ROLF NIEDERMEIER‡ , ˇ ´ § , AND MATHIAS WELLER¶ MANUEL SORGE‡ , ONDREJ POLYNOMIAL-TIME DATA REDUCTION FOR THE SUBSET INTERCONNECTION DESIGN PROBLEM† JIEHUA CHEN‡ , CHRISTIAN KOMUSIEWICZ‡ , ROLF NIEDERMEIER‡ , ˇ ´ § , AND MATHIAS WELLER¶ MANUEL SORGE‡ , ONDREJ](https://www.pdfsearch.io/img/a7d3b32bd4bb66430008810772d564dc.jpg) | Add to Reading ListSource URL: fpt.akt.tu-berlin.deLanguage: 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) On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL)](https://www.pdfsearch.io/img/3f9f97f8ce47a4699178e3a8bf9ef371.jpg) | Add to Reading ListSource URL: www.cs.swan.ac.ukLanguage: English - Date: 2015-05-05 07:12:16
|
---|
7![On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA](https://www.pdfsearch.io/img/2d36506e9d01170aadff2373e546f19d.jpg) | Add to Reading ListSource URL: ftp.cs.rutgers.eduLanguage: English - Date: 2008-12-08 14:23:03
|
---|
8![CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers†](https://www.pdfsearch.io/img/23746207b116a9a71f812e7c0e34886a.jpg) | Add to Reading ListSource URL: www.cccg.caLanguage: English - Date: 2013-08-11 21:51:56
|
---|
9![Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡](https://www.pdfsearch.io/img/578eaaffc97eaf8e3dee5a88254c62d2.jpg) | Add to Reading ListSource URL: www.cs.technion.ac.ilLanguage: English - Date: 2011-10-04 12:29:59
|
---|