The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Computational Complexity"( http://dblp.L3S.de/Venues/Computational_Complexity )

URL (DBLP): http://dblp.uni-trier.de/db/journals/cc

Publication years (Num. hits)
1991 (15) 1992 (17) 1993 (18) 1994 (20) 1995 (16) 1997 (20) 1998 (16) 1999 (18) 2000-2001 (26) 2002-2004 (16) 2005 (15) 2006 (22) 2007-2008 (36) 2009 (21) 2010 (22) 2011 (22) 2012 (20) 2013 (23) 2014 (17) 2015 (19) 2016 (23) 2017 (24) 2018 (16) 2019 (4)
Publication types (Num. hits)
article(466)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 215 occurrences of 67 keywords

Results
Found 466 publication records. Showing 466 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson 0001 Query-to-Communication Lifting for P NP. Search on Bibsonomy Computational Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthias Christandl, Péter Vrana, Jeroen Zuiddam Asymptotic tensor rank of graph tensors: beyond matrix multiplication. Search on Bibsonomy Computational Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthias Christandl, Jeroen Zuiddam Tensor surgery and tensor rank. Search on Bibsonomy Computational Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. Search on Bibsonomy Computational Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bruno Bauwens, Anton Makhlin, Nikolai K. Vereshchagin, Marius Zimand Short lists with short programs in short time. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Srikanth Srinivasan 0001 On the hardness of the noncommutative determinant. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anurag Pandey, Nitin Saxena 0001, Amit Sinhababu Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tom Gur, Ron D. Rothblum Non-interactive proofs of proximity. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Badih Ghazi, Ilan Komargodski, Pravesh K. Kothari, Madhu Sudan Communication with Contextual Uncertainty. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam Constructive non-commutative rank computation is in deterministic polynomial time. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman The Average Sensitivity of Bounded-Depth Formulas. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Avishay Tal Matrix rigidity of random Toeplitz matrices. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Leslie G. Valiant Some observations on holographic algorithms. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mika Göös, Toniann Pitassi, Thomas Watson 0001 The Landscape of Communication Complexity Classes. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Emanuele Viola, Avi Wigderson Local Expanders. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Clément L. Canonne, Tom Gur An adaptivity hierarchy theorem for property testing. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Irit Dinur, Or Meir Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1John M. Hitchcock, Hadi Shafei Autoreducibility of NP-Complete Sets under Strong Hypotheses. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sergey Fomin, Dima Grigoriev, Dorian Nogneng, Éric Schost On semiring complexity of Schur polynomials. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander A. Razborov On Space and Depth in Resolution. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam Non-commutative Edmonds' problem and matrix semi-invariants. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg, Heng Guo 0001 The Complexity of Approximating complex-valued Ising and Tutte partition functions. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Frederic Green, Daniel Kreymer, Emanuele Viola Block-symmetric polynomials correlate with parity better than symmetric. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rohit Gurjar, Arpita Korwar, Nitin Saxena 0001, Thomas Thierauf Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eric Allender, Dhiraj Holden, Valentine Kabanets The Minimum Oracle Circuit Size Problem. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Baris Aydinlioglu, Dieter van Melkebeek Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter On vanishing of Kronecker coefficients. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rahul Jain 0001, Zhaohui Wei, Penghui Yao, Shengyu Zhang Multipartite Quantum Correlation and Communication Complexities. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky Graph Isomorphism, Color Refinement, and Compactness. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jakob Nordström Tight Size-Degree Bounds for Sums-of-Squares Proofs. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Salman Beigi, Omid Etesami, Amin Gohari The Value of Help Bits in Randomized and Average-Case Complexity. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gábor Braun, Rahul Jain 0001, Troy Lee, Sebastian Pokutta Information-theoretic approximations of the nonnegative rank. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Elena Grigorescu, Chris Peikert List-Decoding Barnes-Wall Lattices. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ishay Haviv, Ning Xie 0002 Sunflowers and Testing Triangle-Freeness of Functions. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dana Moshkovitz Low-degree test with polynomially small error. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Russell Impagliazzo, Valentine Kabanets Fourier Concentration from Shrinkage. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Igor Pak, Greta Panova On the complexity of computing Kronecker coefficients. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis, Aris Tentes On the connection between interval size functions and path counting. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Priyanka Mukhopadhyay, Youming Qiao Sparse multivariate polynomial interpolation on the basis of Schubert polynomials. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amir Shpilka, Avishay Tal, Ben lee Volk On the Structure of Boolean Functions with Small Spectral Norm. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eric Allender, Anna Gál, Ian Mertz Dual VP Classes. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan Sparse affine-invariant linear codes are locally testable. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrei Gabrielov, Nicolai Vorobjov Topological lower bounds for arithmetic networks. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dean Doron, Amir Sarid, Amnon Ta-Shma On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rafael Pass Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia, Daniel Wichs A counterexample to the chain rule for conditional HILL entropy. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001 Special Issue on the 10th Theory of Cryptography Conference: Editor's Foreword. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Benny Applebaum Cryptographic Hardness of Random Local Functions - Survey. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yuichi Yoshida Testing list H-homomorphisms. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andrew Hughes, Debasis Mandal, Aduri Pavan, Nathan Russell, Alan L. Selman A thirty Year old conjecture about promise problems. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1André Chailloux, Iordanis Kerenidis, Bill Rosgen Quantum commitments from complexity assumptions. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jean Bourgain, Zeev Dvir, Ethan Leeman Affine extractors over large fields with exponential error. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Klaus Aehlig, Stephen A. Cook, Phuong Nguyen Relativizing small complexity classes and their theories. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Or Meir Combinatorial PCPs with Short Proofs. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eric Allender, Fengming Wang On the power of algebraic branching programs of width two. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Blondin, Andreas Krebs, Pierre McKenzie The complexity of intersecting finite automata having few final states. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sangxia Huang, Pinyan Lu A Dichotomy for Real Weighted Holant Problems. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alex Samorodnitsky, Ilya D. Shkredov, Sergey Yekhanin Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Rafael Oliveira Factors of low individual degree polynomials. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Rafael Mendes de Oliveira, Amir Shpilka, Ben lee Volk Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Neeraj Kayal, Chandan Saha 0001 Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yasuhiro Takahashi, Seiichiro Tani Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, David Zuckerman Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Thomas Watson 0001 The complexity of estimating min-entropy. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laurent Evain, Mathias Lederer, Bjarke Hammersholt Roune Connect Four and Graph Decomposition. Search on Bibsonomy Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Thomas Watson 0001 Query Complexity in Errorless Hardness Amplification. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dima Grigoriev, Vladimir V. Podolskii Complexity of Tropical and Min-plus Linear Prevarieties. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Arne Storjohann On the complexity of inverting integer and polynomial matrices. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Arnab Bhattacharyya 0001, Ning Xie 0002 Lower bounds for testing triangle-freeness in Boolean functions. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Samuel R. Buss, Ryan Williams 0001 Limits on Alternation Trading Proofs for Time-Space Lower Bounds. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Amir Shpilka, Ilya Volkovich Read-once polynomial identity testing. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Irit Dinur, David Steurer, Thomas Vidick A parallel repetition theorem for entangled projection games. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen The NOF Multiparty Communication Complexity of Composed Functions. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael E. Saks Special issue "Conference on Computational Complexity 2014" Guest Editor's Foreword. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Joshua A. Grochow Unifying Known Lower Bounds via Geometric Complexity Theory. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Aleksandrs Belovs Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf, Amir Shpilka Equivalence of Polynomial Identity Testing and Polynomial Factorization. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Noga Alon, Gil Cohen On Rigid Matrices and U-Polynomials. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Michael Viderman Composition of semi-LTCs by two-wise tensor products. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ishay Haviv The remote set problem on lattices. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tom Cooney, Marius Junge, Carlos Palazuelos, David Pérez-García Rank-one quantum games. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Matthew Anderson, Dieter van Melkebeek, Ilya Volkovich Deterministic polynomial identity tests for multilinear bounded-read formulae. Search on Bibsonomy Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hervé Fournier, Guillaume Malod, Stefan Mengel Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Search on Bibsonomy Computational Complexity The full citation details ... 2015 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 Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, János Kollár, Shachar Lovett Variety Evasive Sets. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Randomness Buys Depth for Approximate Counting. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran ReachFewL = ReachUL. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christopher Umans Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Matei David, Periklis A. Papakonstantinou Tradeoff lower lounds for stack machines. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rahul Santhanam, Ryan Williams 0001 On Uniformity and Circuit Lower Bounds. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Martin Mundhenk, Felix Weiss An AC 1-complete model checking problem for intuitionistic logic. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sergei Artemenko, Ronen Shaltiel Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. Search on Bibsonomy Computational Complexity The full citation details ... 2014 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 Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jason Teutsch Short lists for shortest descriptions in short time. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma Using Elimination Theory to Construct Rigid Matrices. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb Choosing, Agreeing, and Eliminating in Communication Complexity. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane The correct exponent for the Gotsman-Linial Conjecture. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Or Meir Combinatorial PCPs with Efficient Verifiers. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 466 (100 per page; Change: )
Pages: [1][2][3][4][5][>>]
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