The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Electronic Colloquium on Computational Complexity (ECCC)"( http://dblp.L3S.de/Venues/Electronic_Colloquium_on_Computational_Complexity_(ECCC) )

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

Publication years (Num. hits)
1994 (27) 1995 (63) 1996 (67) 1997 (61) 1998 (78) 1999 (48) 2000 (91) 2001 (104) 2002 (74) 2003 (87) 2004 (121) 2005 (163) 2006 (160) 2007 (137) 2008 (110) 2009 (147) 2010 (202) 2011 (174) 2012 (186) 2013 (191) 2014 (184) 2015 (208) 2016 (206) 2017 (193) 2018 (213) 2019 (43)
Publication types (Num. hits)
article(3338)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 3338 publication records. Showing 3338 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov 0001 On OBDD-based algorithms and proof systems that dynamically change order of variables. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Toniann Pitassi, Morgan Shirley, Thomas Watson 0001 Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Ashish Dwivedi, Rajat Mittal, Nitin Saxena 0001 Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Amey Bhangale, Subhash Khot UG-hardness to NP-hardness by Losing Half. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Claude Crépeau, Nan Yang Non-Locality in Interactive Proofs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal AC0[p] Lower Bounds against MCSP via the Coin Problem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Anna Gál, Ridwan Syed Upper Bounds on Communication in terms of Approximate Rank. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexander A. Sherstov, Pei Wu Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexander A. Sherstov The hardest halfspace. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Jiawei Gao 0001, Russell Impagliazzo The Fine-Grained Complexity of Strengthenings of First-Order Logic. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Shachar Lovett, Noam Solomon, Jiapeng Zhang From DNF compression to sunflower theorems via regularity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Lijie Chen Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan Statistical Difference Beyond the Polarizing Regime. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis The Complexity of Finding {$S$}-factors in Regular Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Dorit Aharonov, Alex Bredariol Grilo Stoquastic PCP vs. Randomness. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Shuichi Hirahara, Osamu Watanabe 0001 On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Mrinal Kumar 0001, Rafael Mendes de Oliveira, Ramprasad Saptharishi Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram Quantum hardness of learning shallow classical circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Ludmila Glinskih, Dmitry Itsykson On Tseitin formulas, read-once branching programs and treewidth. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Srikanth Srinivasan 0001 Strongly Exponential Separation Between Monotone VP and Monotone VNP. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Rahul Ilango $AC^0[p]$ Lower Bounds and NP-Hardness for Variants of MCSP. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1William Kretschmer QMA Lower Bounds for Approximate Counting. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Orr Paradise Smooth and Strong PCPs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii Complexity of Linear Operators. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Chin Ho Lee Fourier bounds and pseudorandom generators for product tests. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Oded Goldreich 0001 Multi-pseudodeterministic algorithms. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Eric Allender, Archit Chauhan, Samir Datta, Anish Mukherjee 0001 Planarity, Exclusivity, and Unambiguity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Omar Alrabiah, Venkatesan Guruswami An Exponential Lower Bound on the Sub-Packetization of MSR Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha 0001 Determinant equivalence test over finite fields and over $\mathbf{Q}$. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Hrubes On the complexity of computing a random Boolean function over the reals. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Alexey Milovanov PIT for depth-4 circuits and Sylvester-Gallai theorem for polynomials. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Himanshu Tyagi, Shun Watanabe A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Hrubes On $\epsilon$-sensitive monotone computations. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh Lower Bounds for Linear Decision Lists. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Mark Bun, Nikhil S. Mande, Justin Thaler Sign-Rank Can Increase Under Intersection. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Ashish Dwivedi, Rajat Mittal, Nitin Saxena 0001 Efficiently factoring polynomials modulo $p^4$. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Russell Impagliazzo, Sasank Mouli, Toniann Pitassi The Surprising Power of Constant Depth Algebraic Proofs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Benny Applebaum, Eliran Kachlon Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Chi-Ning Chou, Mrinal Kumar, Noam Solomon Closure of VP under taking factors: a short and simple proof. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Irit Dinur, Tali Kaufman, Noga Ron-Zewi From Local to Robust Testing via Agreement Testing. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan 0001 On the Probabilistic Degree of OR over the Reals. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Anurag Anshu, Naresh Goud Boddu, Dave Touchette Quantum Log-Approximate-Rank Conjecture is also False. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan 0001 A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Shachar Lovett A proof of the GM-MDS conjecture. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan Non-Malleable Codes for Small-Depth Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Arnab Bhattacharyya 0001, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Ilya Volkovich A story of AM and Unique-SAT. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Anastasiya Chistopolskaya, Vladimir V. Podolskii Parity Decision Tree Complexity is Greater Than Granularity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Alexander Knop The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Deeparnab Chakrabarty, C. Seshadhri Adaptive Boolean Monotonicity Testing in Total Influence Time. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Lijie Chen, Roei Tell Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Xinyu Wu A stochastic calculus approach to the oracle separation of BQP and PH. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Justin Holmgren, Lisa Yang Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples and a Dichotomy Theorem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Emanuele Viola AC0 unpredictability. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Omri Ben-Eliezer, Eldar Fischer Earthmover Resilience and Testing in Ordered Structures. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Ankit Garg, Rafael Mendes de Oliveira Recent progress on scaling algorithms and applications. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Siddhesh Chaubal, Anna Gál New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Eshan Chattopadhyay, Xin Li Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Swagato Sanyal A Composition Theorem via Conflict Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Prerona Chatterjee, Ramprasad Saptharishi Constructing Faithful Homomorphisms over Fields of Finite Characteristic. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Ran Raz, Avishay Tal Oracle Separation of BQP and PH. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Tim Roughgarden Complexity Theory, Game Theory, and Economics. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Tali Kaufman, David Mass Cosystolic Expanders over any Abelian Group. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov 0001 Reordering Rule Makes OBDD Proof Systems Stronger. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Judith Clymo More on Size and Width in QBF Resolution. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan XOR Codes and Sparse Random Linear Equations with Noise. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Tayfun Pay, James L. Cox An overview of some semantic and syntactic complexity classes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Jayadev Acharya, Clément L. Canonne, Himanshu Tyagi Distributed Simulation and Distributed Inference. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Guy N. Rothblum Counting t-cliques: Worst-case to average-case reductions and Direct interactive proof systems. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Dean Doron, Pooya Hatami, William Hoza Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Craig Gentry, Charanjit S. Jutla Obfuscation using Tensor Products. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Tom Gur, Igor Shinkar An Entropy Lower Bound for Non-Malleable Extractors. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Zhao Song, David P. Woodruff, Peilin Zhong Relative Error Tensor Low Rank Approximation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Igor Carboni Oliveira, Rahul Santhanam Pseudo-derandomizing learning and approximation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Sandip Sinha, Omri Weinstein Local Decodability of the Burrows-Wheeler Transform. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Michael A. Forbes, Sumanta Ghosh, Nitin Saxena 0001 Towards blackbox identity testing of log-variate circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Marco Carmosino, Russell Impagliazzo, Manuel Sabin Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Ashutosh Kumar 0002, Raghu Meka, Amit Sahai Leakage-Resilient Secret Sharing. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Valentine Kabanets, Zhenjian Lu Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial Threshold Gates. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Krishnamoorthy Dinesh 0001, Jayalal Sarma Sensitivity, Affine Transforms and Quantum Communication Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Saikrishna Badrinarayanan, Yael Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs Non-Interactive Delegation for Low-Space Non-Deterministic Computation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Young Kun Ko On Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Xin Li, Shachar Lovett, Jiapeng Zhang Sunflowers and Quasi-sunflowers from Randomness Extractors. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Zeyu Guo, Nitin Saxena 0001, Amit Sinhababu Algebraic dependencies and PSPACE algorithms in approximative complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Yonatan Nakar, Dana Ron On the Testability of Graph Partition Properties. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan 0001 A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett Pseudorandom Generators from Polarizing Random Walks. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Stefan S. Dantchev, Nicola Galesi, Barnaby Martin Resolution and the binary encoding of combinatorial principles. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Gautam Kamath, Christos Tzamos Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Scott Aaronson Quantum Lower Bound for Approximate Counting Via Laurent Polynomials. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Giuseppe Persiano, Kevin Yeo Lower Bounds for Differentially Private RAMs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf Worst-case to average case reductions for the distance to a code. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Mrinal Kumar 0001, Ramprasad Saptharishi, Anamay Tengse Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 3338 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
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