The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "IEEE Conference on Computational Complexity"( http://dblp.L3S.de/Venues/IEEE_Conference_on_Computational_Complexity )

URL (DBLP): http://dblp.uni-trier.de/db/conf/coco

Publication years (Num. hits)
1996 (31) 1997 (32) 1998 (28) 1999 (31) 2000 (30) 2001 (31) 2002 (37) 2003 (32) 2004 (31) 2005 (34) 2006 (35) 2007 (31) 2008 (33) 2009 (38) 2010 (29) 2011 (31) 2012 (37) 2013 (30) 2014 (32)
Publication types (Num. hits)
inproceedings(594) proceedings(19)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 446 occurrences of 248 keywords

Results
Found 613 publication records. Showing 613 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Daniel Dadush, Oded Regev 0001, Noah Stephens-Davidowitz On the Closest Vector Problem with a Distance Guarantee. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Russell Impagliazzo, Valentine Kabanets Fourier Concentration from Shrinkage. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Massimo Lauria, Jakob Nordström Narrow Proofs May Be Maximally Long. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Irit Dinur, David Steurer Direct Product Testing. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan O'Donnell, David Witmer Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Andris Ambainis On Physical Problems that are Slightly More Difficult than QMA. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Joshua A. Grochow Unifying Known Lower Bounds via Geometric Complexity Theory. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1James R. Lee, Prasad Raghavendra, David Steurer, Ning Tan On the Power of Symmetric LP and SDP Relaxations. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Shubhangi Saraf Recent Progress on Lower Bounds for Arithmetic Circuits. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniele Micciancio Locally Dense Codes. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Arturs Backurs, Mohammad Bavarian On the Sum of L1 Influences. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz AM with Multiple Merlins. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan O'Donnell, John Wright 0001, Yu Zhao, Xiaorui Sun, Li-Yang Tan A Composition Theorem for Parity Kill Number. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Joshua A. Grochow, Youming Qiao Algorithms for Group Isomorphism via Group Extensions and Cohomology. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Andreas Göbel 0001, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami Counting List Matrix Partitions of Graphs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rishi Saket Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf, Amir Shpilka Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Craig Gentry Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's Theorem. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Aleksandrs Belovs Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Simon Straub, Thomas Thierauf, Fabian Wagner Counting the Number of Perfect Matchings in K5-Free Graphs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Karl Wimmer Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ryan Williams 0001 Algorithms for Circuits and Circuits for Algorithms. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Chaoping Xing Hitting Sets for Low-Degree Polynomials with Optimal Density. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rahul Jain 0001, Attila Pereszlényi, Penghui Yao A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman Mining Circuit Lower Bound Proofs for Meta-algorithms. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Periklis A. Papakonstantinou, Dominik Scheder, Hao Song Overlays and Limited Memory Communication. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1 IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014 Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  BibTeX  RDF
1Bruno Bauwens, Marius Zimand Linear List-Approximation for Short Programs (or the Power of a Few Random Bits). Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Eric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev Lower Bounds for Testing Properties of Functions over Hypergrid Domains. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Irit Dinur, David Steurer, Thomas Vidick A Parallel Repetition Theorem for Entangled Projection Games. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sepp Hartung, André Nichterlein On the Parameterized and Approximation Hardness of Metric Dimension. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Oded Regev 0001, Thomas Vidick Quantum XOR Games. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pavel Hrubes, Amir Yehudayoff Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Aleksandrs Belovs, Ansis Rosmanis On the Power of Non-adaptive Learning Graphs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Madhur Tulsiani, Pratik Worah LS+ Lower Bounds from Pairwise Independence. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane The Correct Exponent for the Gotsman-Linial Conjecture. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Luca Trevisan, Tongke Xue A Derandomized Switching Lemma and an Improved Derandomization of AC0. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Justin Gilmer, Michael E. Saks, Srikanth Srinivasan 0001 Composition Limits and Separating Examples for Some Boolean Function Complexity Measures. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sushant Sachdeva, Rishi Saket Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert On the Lattice Smoothing Parameter Problem. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Adam R. Klivans, Pravesh Kothari, Igor Carboni Oliveira Constructing Hard Functions Using Learning Algorithms. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Patrick M. Hayden, Kevin Milner, Mark M. Wilde Two-Message Quantum Interactive Proofs and the Quantum Separability Problem. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dmitry Gavinsky, Tsuyoshi Ito, Guoming Wang Shared Randomness and Quantum Communication in the Multi-party Model. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand Short Lists with Short Programs in Short Time. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Viderman Strong LTCs with Inverse Polylogarithmic Rate and Soundness. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1John P. Steinberger The Distinguishability of Product Distributions by Read-Once Branching Programs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Noga Alon, Gil Cohen On Rigid Matrices and U-polynomials. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Moritz Müller, Sergi Oliva Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Tatsuya 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 IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yasuhiro Takahashi, Seiichiro Tani Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Ronald de Wolf How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions? Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ankit Gupta 0001, Neeraj Kayal, Youming Qiao Random Arithmetic Formulas Can Be Reconstructed Efficiently. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Ryan Williams 0001 On Medium-Uniformity and Circuit Lower Bounds. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ankit Gupta 0001, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi Approaching the Chasm at Depth Four. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 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 IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  BibTeX  RDF
1Irit Dinur, Gillat Kol Covering CSPs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Krzysztof Onak Superlinear Lower Bounds for Multipass Graph Processing. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Siu Man Chan Just a Pebble Game. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Eric Blais, Li-Yang Tan Approximating Boolean Functions with Depth-2 Circuits. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin Towards a Reverse Newman's Theorem in Interactive Information Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe 0001 Is Valiant-Vazirani's Isolation Probability Improvable? Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paul Beame, Russell Impagliazzo, Srikanth Srinivasan 0001 Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gil Cohen, Ran Raz, Gil Segev Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi Space Complexity in Polynomial Calculus. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dmitry Gavinsky Quantum Money with Classical Verification. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Derrick Stolee, N. V. Vinodchandran Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Baris Aydinlioglu, Dieter van Melkebeek Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ran Raz, Ricky Rosen A Strong Parallel Repetition Theorem for Projection Games on Expanders. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Chi-Jen Lu Hitting Set Generators for Sparse Polynomials over Any Finite Fields. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan 0001 Pseudorandom Generators for Read-Once ACC^0. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 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 IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  BibTeX  RDF
1Guy Kindler, Ryan O'Donnell Gaussian Noise Sensitivity and Fourier Tails. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Prasad Raghavendra, David Steurer, Madhur Tulsiani Reductions between Expansion Problems. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Per Austrin, Johan Håstad On the Usefulness of Predicates. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Toniann Pitassi Communication Complexity and Information Complexity: Foundations and New Directions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1André Chailloux, Or Sattath The Complexity of the Separable Hamiltonian Problem. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yuichi Yoshida Testing List H-homomorphisms. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Elena Grigorescu, Chris Peikert List Decoding Barnes-Wall Lattices. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kazuhisa Seto, Suguru Tamaki A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andrew Drucker Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Joshua A. Grochow Matrix Isomorphism of Matrix Lie Algebras. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amnon Ta-Shma, Christopher Umans Better Condensers and New Extractors from Parvaresh-Vardy Codes. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Richard J. Lipton, Ryan Williams 0001 Amplifying Circuit Lower Bounds against Polynomial Time with Applications. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Troy Lee, Jérémie Roland A Strong Direct Product Theorem for Quantum Query Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi The Hardness of Being Private. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sangxia Huang, Pinyan Lu A Dichotomy for Real Weighted Holant Problems. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold DNF Sparsification and a Faster Deterministic Counting Algorithm. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marek 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 IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Samuel R. Buss, Ryan Williams 0001 Limits on Alternation-Trading Proofs for Time-Space Lower Bounds. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Or Meir Combinatorial PCPs with Short Proofs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Bekhan Chokaev Algebras of Minimal Multiplicative Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sourav Chakraborty 0001, Eldar Fischer, David García-Soriano, Arie Matsliah Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov Share Conversion and Private Information Retrieval. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser Prospects for Geometric Complexity Theory. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Noga Alon, Amir Shpilka, Christopher Umans On Sunflowers and Matrix Multiplication. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gus Gutoski, Xiaodi Wu Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Guy Moshkovitz Complexity Lower Bounds through Balanced Graph Properties. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 613 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license