Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | |
IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![IEEE Computer Society, 978-1-4799-3626-7 The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
1 | Ryan Williams 0001 |
Algorithms for Circuits and Circuits for 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. 248-261, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Swastik Kopparty, Shubhangi Saraf, Amir Shpilka |
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 169-180, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | James R. Lee, Prasad Raghavendra, David Steurer, Ning Tan 0002 |
On the Power of Symmetric LP and SDP Relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 13-21, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Karl Wimmer |
Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 120-131, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz |
AM with Multiple Merlins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 44-55, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Chaoping Xing |
Hitting Sets for Low-Degree Polynomials with Optimal Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 161-168, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Aleksandrs Belovs |
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 22-31, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Arturs Backurs, Mohammad Bavarian |
On the Sum of L1 Influences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 132-143, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Jain 0001, Attila Pereszlényi, Penghui Yao |
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 209-216, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Anindya De, Ilias Diakonikolas, Rocco A. Servedio |
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 229-240, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Albert Atserias, Massimo Lauria, Jakob Nordström |
Narrow Proofs May Be Maximally Long. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 286-297, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Bauwens, Marius Zimand |
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 241-247, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Simon Straub, Thomas Thierauf, Fabian Wagner |
Counting the Number of Perfect Matchings in K5-Free 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. 66-77, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Aleksandrs Belovs, Ansis Rosmanis |
On the Power of Non-adaptive Learning Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 44-55, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Andris Ambainis, Ronald de Wolf |
How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 179-184, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Adam R. Klivans, Pravesh Kothari, Igor C. Oliveira |
Constructing Hard Functions Using Learning Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 86-97, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Patrick M. Hayden, Kevin Milner, Mark M. Wilde |
Two-Message Quantum Interactive Proofs and the Quantum Separability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 156-167, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Albert Atserias, Moritz Müller, Sergi Oliva |
Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 109-120, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Siu Man Chan |
Just a Pebble Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 133-143, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Luca Trevisan, Tongke Xue |
A Derandomized Switching Lemma and an Improved Derandomization of AC0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 242-247, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | John P. Steinberger |
The Distinguishability of Product Distributions by Read-Once Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 248-254, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sepp Hartung, André Nichterlein |
On the Parameterized and Approximation Hardness of Metric Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 266-276, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sushant Sachdeva, Rishi Saket |
Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 219-229, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Santhanam, Ryan Williams 0001 |
On Medium-Uniformity and Circuit Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 15-23, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Justin Gilmer, Michael E. Saks, Srikanth Srinivasan 0001 |
Composition Limits and Separating Examples for Some Boolean Function Complexity Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 185-196, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Daniel M. Kane |
The Correct Exponent for the Gotsman-Linial Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 56-64, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Noga Alon, Gil Cohen |
On Rigid Matrices and U-polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 197-206, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ankit Gupta 0001, Neeraj Kayal, Youming Qiao |
Random Arithmetic Formulas Can Be Reconstructed Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 1-9, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Gavinsky, Tsuyoshi Ito, Guoming Wang |
Shared Randomness and Quantum Communication in the Multi-party Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 34-43, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Michael Viderman |
Strong LTCs with Inverse Polylogarithmic Rate and Soundness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 255-265, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand |
Short Lists with Short Programs in Short Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 98-108, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ankit Gupta 0001, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi |
Approaching the Chasm at Depth Four. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 65-73, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | |
Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![IEEE Computer Society, 978-0-7695-4997-2 The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
1 | Eric Blais, Li-Yang Tan |
Approximating Boolean Functions with Depth-2 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 74-85, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert |
On the Lattice Smoothing Parameter Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 230-241, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Madhur Tulsiani, Pratik Worah |
LS+ Lower Bounds from Pairwise Independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 121-132, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe 0001 |
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 277-286, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Irit Dinur, Gillat Kol |
Covering CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 207-218, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Yasuhiro Takahashi, Seiichiro Tani |
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 168-178, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Krzysztof Onak |
Superlinear Lower Bounds for Multipass Graph Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 287-298, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Hrubes, Amir Yehudayoff |
Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 10-14, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Brody, Harry Buhrman, Michal Koucký 0001, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin |
Towards a Reverse Newman's Theorem in Interactive Information Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 24-33, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Oded Regev 0001, Thomas Vidick |
Quantum XOR Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 144-155, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Gil Cohen, Ran Raz, Gil Segev 0001 |
Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 298-308, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe 0001 |
Is Valiant-Vazirani's Isolation Probability Improvable? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 10-20, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov |
Share Conversion and Private Information Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 258-268, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Gavinsky |
Quantum Money with Classical Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 42-52, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Joshua A. Grochow |
Matrix Isomorphism of Matrix Lie Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 203-213, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Guy Moshkovitz |
Complexity Lower Bounds through Balanced Graph Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 159-169, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | André Chailloux, Or Sattath |
The Complexity of the Separable Hamiltonian Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 32-41, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Chi-Jen Lu |
Hitting Set Generators for Sparse Polynomials over Any Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 280-286, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Samuel R. Buss, Ryan Williams 0001 |
Limits on Alternation-Trading Proofs for Time-Space Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 181-191, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Prasad Raghavendra, David Steurer, Madhur Tulsiani |
Reductions between Expansion Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 64-73, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Amnon Ta-Shma, Christopher Umans |
Better Condensers and New Extractors from Parvaresh-Vardy Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 309-315, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Per Austrin, Johan Håstad |
On the Usefulness of Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 53-63, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký 0001, Toniann Pitassi |
The Hardness of Being Private. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 192-202, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Noga Alon, Amir Shpilka, Christopher Umans |
On Sunflowers and Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 214-223, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Sourav Chakraborty 0001, Eldar Fischer, David García-Soriano, Arie Matsliah |
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 148-158, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan 0001 |
Pseudorandom Generators for Read-Once ACC^0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 287-297, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Troy Lee, Jérémie Roland |
A Strong Direct Product Theorem for Quantum Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 236-246, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Sangxia Huang, Pinyan Lu |
A Dichotomy for Real Weighted Holant Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 96-106, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Andrew Drucker |
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 170-180, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Baris Aydinlioglu, Dieter van Melkebeek |
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 269-279, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Gus Gutoski, Xiaodi Wu |
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 21-31, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Toniann Pitassi |
Communication Complexity and Information Complexity: Foundations and New Directions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 136, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Paul Beame, Russell Impagliazzo, Srikanth Srinivasan 0001 |
Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 117-125, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Yuichi Yoshida |
Testing List H-homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 85-95, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Peter Bürgisser |
Prospects for Geometric Complexity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 235, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | |
Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![IEEE Computer Society, 978-1-4673-1663-7 The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
1 | Derrick Stolee, N. V. Vinodchandran |
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 326-333, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh 0001, Magnus Wahlström |
On Problems as Hard as CNF-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 74-84, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Elena Grigorescu, Chris Peikert |
List Decoding Barnes-Wall Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 316-325, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Parikshit Gopalan, Raghu Meka, Omer Reingold |
DNF Sparsification and a Faster Deterministic Counting Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 126-135, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Or Meir |
Combinatorial PCPs with Short Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 345-355, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Kazuhisa Seto, Suguru Tamaki |
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 107-116, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ran Raz, Ricky Rosen |
A Strong Parallel Repetition Theorem for Projection Games on Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 247-257, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Guy Kindler, Ryan O'Donnell |
Gaussian Noise Sensitivity and Fourier Tails. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 137-147, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Bekhan Chokaev |
Algebras of Minimal Multiplicative Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 224-234, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Richard J. Lipton, Ryan Williams 0001 |
Amplifying Circuit Lower Bounds against Polynomial Time with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 1-9, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi |
Space Complexity in Polynomial Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 334-344, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Xin Li 0006 |
Improved Constructions of Three Source Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 126-136, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Daniel M. Kane |
k-Independent Gaussians Fool Polynomial Threshold Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 252-261, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Boris Alexeev, Michael A. Forbes 0001, Jacob Tsimerman |
Tensor Rank: Some Lower and Upper Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 283-291, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Oded Regev 0001, Giannicola Scarpa, Ronald de Wolf |
Near-Optimal and Explicit Bell Inequality Violations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 157-166, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | |
Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![IEEE Computer Society, 978-0-7695-4411-3 The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
1 | Jin-yi Cai, Xi Chen 0001, Pinyan Lu |
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 45-54, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Shubhangi Saraf, Sergey Yekhanin |
Noisy Interpolation of Sparse Polynomials, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 86-92, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Ryan O'Donnell, Yi Wu 0002, Yuan Zhou 0007 |
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 23-33, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Amir Shpilka, Avishay Tal |
On the Minimal Fourier Degree of Symmetric Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 200-209, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Sevag Gharibian, Julia Kempe |
Approximation Algorithms for QMA-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 178-188, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Eli Ben-Sasson, Michael Viderman |
Towards Lower Bounds on Locally Testable Codes via Density Arguments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 66-76, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Hartmut Klauck |
On Arthur Merlin Games in Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 189-199, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Russell Impagliazzo |
Relativized Separations of Worst-Case and Average-Case Complexities for NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 104-114, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Eric Blais, Joshua Brody, Kevin Matulef |
Property Testing Lower Bounds via Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 210-220, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Anindya De |
Pseudorandomness for Permutation and Regular Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 221-231, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Ryan Williams 0001 |
Non-uniform ACC Circuit Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 115-125, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Marius Zimand |
Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 148-156, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich |
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 273-282, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
Paris-Harrington Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 93-103, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|