What can be computed without communications? Heger Arfaoui and

First Page		Document Content
Date: 2012-04-26 12:02:48 Quantum complexity theory PP Independence Random variable Support Function Quantum nonlocality Mathematics Probability theory Applied mathematics		What can be computed without communications? Heger Arfaoui and Add to Reading List Source URL: www.liafa.jussieu.fr Download Document from Source Website File Size: 213,42 KB Share Document on Facebook

	Guidelines for Authors Manuscripts: 1) QIC publishes papers in all areas of quantum information processing, including quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum DocID: 1rFsf - View Document
	Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk DocID: 1rgTf - View Document
	The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford DocID: 1r1Rx - View Document
	Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11. DocID: 1r02x - View Document
	Networks embedded in Lorentzian spaces James Clough, Tim Evans Centre for Complexity Science, Imperial College London, London, SW7 2AZ, U.K. {james.clough09,t.evans}@imperial.ac.uk Embedding the nodes of a network in a s DocID: 1qZhx - View Document