Bounded-error probabilistic polynomial

Results: 151



#Item
1This is just a short update on the FATF organized consultation meeting on the revision of the Best Practice Paper (BPP) in Brussels on March 25. It covers their response to our sign on letter, the main substantive points

This is just a short update on the FATF organized consultation meeting on the revision of the Best Practice Paper (BPP) in Brussels on March 25. It covers their response to our sign on letter, the main substantive points

Add to Reading List

Source URL: fatfplatform.org

Language: English - Date: 2015-03-30 05:35:57
2Nonprofit organization / Risk management / Bounded-error probabilistic polynomial / Money laundering / Non-governmental organization / Charitable organization / Risk / Due diligence / Law / Ethics / Structure

April 24, 2015 To: Mr. Roger Wilkins AO, FATF President By email

Add to Reading List

Source URL: fatfplatform.org

Language: English - Date: 2015-04-21 03:20:58
3How hard is it to approximate the Jones polynomial? Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CAarXiv:0908.0512v2 [quant-ph] 27 Oct 2014

How hard is it to approximate the Jones polynomial? Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CAarXiv:0908.0512v2 [quant-ph] 27 Oct 2014

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-10-27 20:33:15
4Let X be an M×N grayscale image with n=MN pixels xi with values in the set {0, 1, …, 255}

Let X be an M×N grayscale image with n=MN pixels xi with values in the set {0, 1, …, 255}

Add to Reading List

Source URL: www.ws.binghamton.edu

Language: English - Date: 2006-04-26 08:10:12
5A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora

A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2010-07-11 20:15:23
6Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2010-05-13 09:33:41
7Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The

Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The

Add to Reading List

Source URL: www98.griffith.edu.au

Language: English - Date: 2011-05-11 13:37:50
8On 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

Add to Reading List

Source URL: ftp.cs.rutgers.edu

Language: English - Date: 2008-12-08 14:23:03
9A Casual Tour Around a Circuit Complexity Bound∗  arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†

A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-11-07 20:15:16
10

PDF Document

Add to Reading List

Source URL: www.m2-academy.edu.sg

Language: English - Date: 2015-02-09 23:41:25