Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Maha Saadeh, Azzam Sleit, Mohammed Qatawneh, Wesam Almobaideen |
Authentication Techniques for the Internet of Things: A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 28-34, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Mohannad Alhanahnah, David W. Chadwick |
Boosting Usability for Protecting Online Banking Applications Against APTs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 70-76, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Esra'a Alshammary, Ali Hadi |
Reviewing and Evaluating Existing File Carving Techniques for JPEG Files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 55-59, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Julian Droogan, Lise Waldek |
Where are All the Cyber Terrorists? From Waiting for Cyber Attack to Understanding Audiences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 100-106, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Chris Moore 0001 |
Detecting Ransomware with Honeypot Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 77-81, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Assmuth, Paul Cockshott, Jana Kipke, Karen Renaud, Lewis Mackenzie, Wim Vanderbauwhede, Matthias Söllner 0001, Tilo Fischer, George R. S. Weir |
Improving Resilience by Deploying Permuted Code onto Physically Unclonable Unique Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 144-150, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Malek Al-Zewairi, Dima Suleiman, Adnan Shaout |
Multilevel Fuzzy Inference System for Risk Adaptive Hybrid RFID Access Control System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 1-7, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | John Oluwole Babatunde |
Experimental and Analytical Evaluation of the Impact of Security Compliance on System Performance of Web Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 130-136, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | MingJian Tang 0001, Mamoun Alazab, Yuxiu Luo |
Exploiting Vulnerability Disclosures: Statistical Framework and Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 117-122, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Mariam Khader, Ali Hadi, Amjad Hudaib |
Covert Communication Using Port Knocking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 22-27, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Asma Salem, Dema Zaidan, Andraws I. Swidan, Ramzi R. Saifan |
Analysis of Strong Password Using Keystroke Dynamics Authentication in Touch Screen Devices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 15-21, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | |
Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![IEEE, 978-1-5090-2657-9 The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
1 | Akram Barakat, Ali Hadi |
Windows Forensic Investigations Using PowerForensics Tool. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2016, Amman, Jordan, August 2-4, 2016, pp. 41-47, 2016, IEEE, 978-1-5090-2657-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Mrinal Kumar 0001, Shubhangi Saraf |
Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 35:1-35:29, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Richard Ryan Williams |
Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 2:1-2:17, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Adam Bouland, Laura Mancinska, Xue Zhang |
Complexity Classification of Two-Qubit Commuting Hamiltonians. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 28:1-28:33, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Mrinal Kumar 0001, Shubhangi Saraf |
Arithmetic Circuits with Locally Low Algebraic Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 34:1-34:27, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Arnab Bhattacharyya 0001, Sivakanth Gopi |
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 12:1-12:17, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Forbes 0001, Amir Shpilka, Iddo Tzameret, Avi Wigderson |
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 32:1-32:17, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Scott Aaronson, Shalev Ben-David |
Sculpting Quantum Speedups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 26:1-26:28, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson |
Degree and Sensitivity: Tails of Two Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 13:1-13:23, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Brakensiek, Venkatesan Guruswami |
New Hardness Results for Graph and Hypergraph Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 14:1-14:27, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Forbes 0001, Mrinal Kumar 0001, Ramprasad Saptharishi |
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 33:1-33:19, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Jaikumar Radhakrishnan |
Tight Bounds for Communication-Assisted Agreement Distillation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 6:1-6:17, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Aram W. Harrow, Anand Natarajan, Xiaodi Wu |
Tight SoS-Degree Bounds for Approximate Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 22:1-22:25, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Shuichi Hirahara, Osamu Watanabe 0001 |
Limits of Minimum Circuit Size Problem as Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 18:1-18:20, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan 0001 |
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 1:1-1:35, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Nisheeth K. Vishnoi |
Evolution and Computation (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 21:1-21:1, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Rohit Gurjar, Arpita Korwar, Nitin Saxena 0001 |
Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 29:1-29:16, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Irit Dinur, Or Meir |
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 3:1-3:51, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Anderson, Michael A. Forbes 0001, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk |
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 30:1-30:25, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Yuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer |
Invariance Principle on the Slice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 15:1-15:10, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös, T. S. Jayram |
A Composition Theorem for Conical Juntas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 5:1-5:16, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Gil Cohen |
Non-Malleable Extractors - New Tools and Improved Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 8:1-8:29, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel |
Pseudorandomness When the Odds are Against You. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 9:1-9:35, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Troy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen |
On the Sum-of-Squares Degree of Symmetric Quadratic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 17:1-17:31, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | J. Niel de Beaudrap, Sevag Gharibian |
A Linear Time Algorithm for Quantum 2-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 27:1-27:21, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Gaurav Sinha |
Reconstruction of Real Depth-3 Circuits with Top Fan-In 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 31:1-31:53, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Yuval Filmus, Elchanan Mossel |
Harmonicity and Invariance on Slices of the Boolean Cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 16:1-16:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Eshan Chattopadhyay, David Zuckerman |
New Extractors for Interleaved Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 7:1-7:28, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | John Y. Kim, Swastik Kopparty |
Decoding Reed-Muller Codes Over Product Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 11:1-11:28, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
Learning Algorithms from Natural Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 10:1-10:24, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 0:i-0:xvi, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs |
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 25:1-25:19, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Andris Ambainis, Martins Kokainis, Robin Kothari |
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 4:1-4:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ryan O'Donnell, Yu Zhao 0032 |
Polynomial Bounds for Decoupling, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 24:1-24:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Yuqing Ai, Wei Hu, Yi Li 0002, David P. Woodruff |
New Characterizations in Turnstile Streams with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 20:1-20:22, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ran Raz (eds.) |
31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8 The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
1 | Xiaotie Deng, Jack R. Edmonds, Zhe Feng 0004, Zhengyang Liu 0002, Qi Qi 0003, Zeying Xu |
Understanding PPA-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 23:1-23:25, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Lance Fortnow, Rahul Santhanam |
New Non-Uniform Lower Bounds for Uniform Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 19:1-19:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Rocco A. Servedio, Li-Yang Tan, John Wright 0004 |
Adaptivity Helps for Testing Juntas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 264-279, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Fu Li, Iddo Tzameret, Zhengyu Wang |
Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 412-432, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Oded Goldreich 0001, Tom Gur, Ilan Komargodski |
Strong Locally Testable Codes with Relaxed Local Decoders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 1-41, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Alex Samorodnitsky, Ilya D. Shkredov, Sergey Yekhanin |
Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 347-364, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Galesi, Pavel Pudlák, Neil Thapen |
The Space Complexity of Cutting Planes Refutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 433-447, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Kai-Min Chung, Xiaodi Wu, Henry S. Yuen |
Parallel Repetition for Entangled k-player Games via Fast Quantum Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 512-536, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Cody D. Murray, Richard Ryan Williams |
On the (Non) NP-Hardness of Computing Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 365-380, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. i-xiv, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Igor Carboni Oliveira, Rahul Santhanam |
Majority is Incompressible by AC^0[p] Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 124-157, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Cedric Yen-Yu Lin, Han-Hsuan Lin |
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 537-566, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Rossman |
Correlation Bounds Against Monotone NC^1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 392-411, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Abhishek Bhowmick 0001, Shachar Lovett |
Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 72-87, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Ameya Velingker |
An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 42-57, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura |
Generalized Quantum Arthur-Merlin Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 488-511, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao 0001 |
How to Compress Asymmetric Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 102-123, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Anup Rao 0001, Amir Yehudayoff |
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 88-101, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Massimo Lauria, Jakob Nordström |
Tight Size-Degree Bounds for Sums-of-Squares Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 448-466, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Amey Bhangale, Prahladh Harsha, Girish Varma |
A Characterization of Hard-to-cover CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 280-303, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Mladen Miksa, Jakob Nordström |
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 467-487, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Rohit Gurjar, Arpita Korwar, Nitin Saxena 0001, Thomas Thierauf |
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 323-346, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Amit Chakrabarti, Graham Cormode, Andrew McGregor 0001, Justin Thaler, Suresh Venkatasubramanian |
Verifiable Stream Computation and Arthur-Merlin Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 217-243, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Suman K. Bera 0001, Amit Chakrabarti |
A Depth-Five Lower Bound for Iterated Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 183-197, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Rafael Mendes de Oliveira |
Factors of Low Individual Degree Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 198-216, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | David Zuckerman (eds.) |
30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1 The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
1 | Oded Goldreich 0001, Emanuele Viola, Avi Wigderson |
On Randomness Extraction in AC0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 601-668, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang 0020 |
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 582-600, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Neeraj Kayal, Chandan Saha 0001 |
Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 158-208, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Hrubes, Anup Rao 0001 |
Circuits with Medium Fan-In. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 381-391, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Shuichi Hirahara |
Identifying an Honest EXP^NP Oracle Among Many. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 244-263, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Daniel M. Kane |
A Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 567-581, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ishay Haviv, Oded Regev 0001 |
The List-Decoding Size of Fourier-Sparse Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 58-71, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Rafael Oliveira 0002, Amir Shpilka, Ben Lee Volk |
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, pp. 304-322, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-81-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Joshua A. Grochow, Youming Qiao |
Algorithms for Group Isomorphism via Group Extensions and Cohomology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 110-119, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Joshua A. Grochow |
Unifying Known Lower Bounds via Geometric Complexity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 274-285, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Craig Gentry |
Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 181-187, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Andris Ambainis |
On Physical Problems that are Slightly More Difficult than QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 32-43, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Irit Dinur, David Steurer, Thomas Vidick |
A Parallel Repetition Theorem for Entangled Projection Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 197-208, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Dadush, Oded Regev 0001, Noah Stephens-Davidowitz |
On the Closest Vector Problem with a Distance Guarantee. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 98-109, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Ryan O'Donnell, John Wright 0004, Yu Zhao 0032, Xiaorui Sun, Li-Yang Tan |
A Composition Theorem for Parity Kill Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 144-154, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Irit Dinur, David Steurer |
Direct Product Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 188-196, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev |
Lower Bounds for Testing Properties of Functions over Hypergrid Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 309-320, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Daniel M. Kane |
A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 217-228, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Rishi Saket |
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 78-89, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Russell Impagliazzo, Valentine Kabanets |
Fourier Concentration from Shrinkage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 321-332, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Periklis A. Papakonstantinou, Dominik Scheder, Hao Song |
Overlays and Limited Memory Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 298-308, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Shubhangi Saraf |
Recent Progress on Lower Bounds for Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 155-160, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Göbel 0001, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami |
Counting List Matrix Partitions of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 56-65, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman |
Mining Circuit Lower Bound Proofs for Meta-algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 262-273, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Daniele Micciancio |
Locally Dense Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 90-97, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Ryan O'Donnell, David Witmer |
Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 1-12, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|