Bounded-error probabilistic polynomial

Results: 151



#Item
1Nonprofit organization / Bounded-error probabilistic polynomial / Structure / Financial regulation / Organisation for Economic Co-operation and Development / Financial Action Task Force on Money Laundering

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
3Polynomials / Matroid theory / Tutte polynomial / Time complexity / IP / XTR / PP / P/poly / Bounded-error probabilistic polynomial / Theoretical computer science / Mathematics / Computational complexity theory

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
4Steganography / Statistical classification / Steganalysis / Digital photography / Gain / Embedding / Receiver operating characteristic / Jessica Fridrich / Bounded-error probabilistic polynomial / Mathematics / Espionage / Statistics

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
5Quantum complexity theory / Bounded-error probabilistic polynomial / Pseudorandom generator / Fourier transform / IP / FO / Theoretical computer science / Applied mathematics / PP

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
6Structural complexity theory / Complexity classes / Models of computation / Lance Fortnow / Probabilistic complexity theory / Interactive proof system / IP / Bounded-error probabilistic polynomial / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics

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
7Packaging / Operations research / Discrete geometry / Bin packing problem / Mathematical optimization / Computational complexity theory / Packing problem / Carton / Bounded-error probabilistic polynomial / Theoretical computer science / Mathematics / Applied mathematics

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
8Complexity classes / Polynomial / Advice / P / Reduction / Time complexity / Bounded-error probabilistic polynomial / Circuit complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

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
9Complexity classes / NTIME / Circuit complexity / P / Bounded-error probabilistic polynomial / Cook–Levin theorem / Time hierarchy theorem / NEXPTIME / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

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
10BPP Holdings / Complete / E-learning / Education / Bounded-error probabilistic polynomial / Association of Chartered Certified Accountants

PDF Document

Add to Reading List

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

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