1![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 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](https://www.pdfsearch.io/img/7af205d1089ec3704abb8a9dbea355e2.jpg) | Add to Reading ListSource URL: www.rintonpress.com- Date: 2006-06-05 20:12:34
|
---|
2![Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk](https://www.pdfsearch.io/img/4b305e1aa3c292b2c758c49b6d6ccfbd.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2006-09-25 10:55:42
|
---|
3![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
|
---|
4![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. 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.](https://www.pdfsearch.io/img/c38a4a114012494114b3aa7d016f7163.jpg) | Add to Reading ListSource URL: people.cs.uchicago.eduLanguage: English - Date: 2014-04-12 03:40:34
|
---|
5![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 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](https://www.pdfsearch.io/img/4241c399bc5b34809bd5870b09f0b717.jpg) | Add to Reading ListSource URL: www.monmeetings.orgLanguage: English - Date: 2015-09-04 10:24:55
|
---|
6![Classical and Quantum Algorithms for Finding Cycles Jill Cirasella Computational Sciences Specialist Brooklyn College Library Classical and Quantum Algorithms for Finding Cycles Jill Cirasella Computational Sciences Specialist Brooklyn College Library](https://www.pdfsearch.io/img/bb2fc8f39c8fcdbdacb6be95879f5848.jpg) | Add to Reading ListSource URL: jillcirasella.commons.gc.cuny.eduLanguage: English - Date: 2014-05-02 15:14:51
|
---|
7![Nonlinearity in Complexity Science R.S.MacKay Mathematics Institute and Centre for Complexity Science University of Warwick, Coventry CV4 7AL, U.K. August 25, 2008 Nonlinearity in Complexity Science R.S.MacKay Mathematics Institute and Centre for Complexity Science University of Warwick, Coventry CV4 7AL, U.K. August 25, 2008](https://www.pdfsearch.io/img/33d48b5592a0ba1c4b228d23fd09b4aa.jpg) | Add to Reading ListSource URL: www2.warwick.ac.ukLanguage: English - Date: 1970-01-01 18:00:00
|
---|
8![LNCSParallel Repetition of Computationally Sound Protocols Revisited LNCSParallel Repetition of Computationally Sound Protocols Revisited](https://www.pdfsearch.io/img/7efff76c9fa87191fbaa1c43f9220aa7.jpg) | Add to Reading ListSource URL: www.nada.kth.seLanguage: English - Date: 2012-05-30 08:49:12
|
---|
9![Probabilistic Inference and Accuracy Guarantees Stefano Ermon CS Department, Stanford Probabilistic Inference and Accuracy Guarantees Stefano Ermon CS Department, Stanford](https://www.pdfsearch.io/img/7df730039f5ecd52a0cd827d5e7ab960.jpg) | Add to Reading ListSource URL: intelligence.orgLanguage: English - Date: 2016-06-01 20:00:33
|
---|
10![Can Quantum Search Accelerate Evolutionary Algorithms? Daniel Johannsen Max Planck Institute for Informatics Department of Algorithms and Complexity Saarbrücken, Germany Can Quantum Search Accelerate Evolutionary Algorithms? Daniel Johannsen Max Planck Institute for Informatics Department of Algorithms and Complexity Saarbrücken, Germany](https://www.pdfsearch.io/img/6c1b795b82ce7d656a8192bc3d60dd42.jpg) | Add to Reading ListSource URL: www.cse.iitk.ac.inLanguage: English - Date: 2016-07-30 09:35:21
|
---|