The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for ac0 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1988-1996 (18) 1997-1999 (18) 2000-2003 (17) 2004-2007 (18) 2008-2010 (20) 2011-2014 (18) 2015-2017 (22) 2018-2019 (18) 2020-2022 (16) 2023-2024 (7)
Publication types (Num. hits)
article(90) incollection(1) inproceedings(81)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 76 occurrences of 59 keywords

Results
Found 172 publication records. Showing 172 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
149Mikkel Thorup On AC0 implementations of fusion trees and atomic heaps. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
131Alexander A. Sherstov Separating AC0 from depth-2 majority circuits. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF AC0, communication complexity, discrepancy, threshold circuits
108Manindra Agrawal, Eric Allender An Isomorphism Theorem for Circuit Complexity. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Complete Sets, Berman-Hartmanis Conjecture, NC1, AC0, NC0, projections, Circuit Complexity, uniformity, Isomorphisms
63Mikkel Thorup Equivalence between priority queues and sorting. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF sorting, Priority queues
63Vikraman Arvind, K. V. Subrahmanyam 0001, N. V. Vinodchandran The Query Complexity of Program Checking by Constant-Depth Circuits. Search on Bibsonomy ISAAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
54Manindra Agrawal Towards Uniform AC0 - Isomorphisms. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
54Andris Ambainis, David A. Mix Barrington, Huong LeThanh On Counting AC0 Circuits with Negative Constants. Search on Bibsonomy MFCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
47Alexander Healy Randomness-Efficient Sampling Within NC1. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
47Fabrice Noilhan, Miklos Santha Semantical Counting Circuits. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
47David A. Mix Barrington, Denis Thérien Finite monoids and the fine structure of NC1. Search on Bibsonomy J. ACM The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
45Phokion G. Kolaitis, Swastik Kopparty Random graphs and the parity quantifier. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF 0-1 law, AC0, modular convergence, first-order logic
38Akinobu Miyata, Jun Tarui, Etsuji Tomita Learning Boolean Functions in AC0 on Attribute and Classification Noise. Search on Bibsonomy ALT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
38Jeffrey C. Jackson, Adam R. Klivans, Rocco A. Servedio Learnability beyond AC0. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
38Torben Hagerup Simpler and Faster Dictionaries on the AC0 RAM. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
32Heribert Vollmer The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Post’s lattice, Membership problem, Computational complexity, Clones, Boolean circuit
32Luc Longpré, Pierre McKenzie The Complexity of Solitaire. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Michal Koucký 0001, Pavel Pudlák, Denis Thérien Bounded-depth circuits: separating wires from gates. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF communication, complexity, lower bounds, regular languages, wires, constant-depth circuits, gates
32Fabrice Noilhan, Miklos Santha Semantical Counting Circuits. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Emanuele Viola Hardness vs. Randomness within Alternating Time. Search on Bibsonomy CCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Johann A. Makowsky Invariant Definability and P/poly. Search on Bibsonomy CSL The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
29Benjamin Rossman On the constant-depth complexity of k-clique. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ac0, bounded variable hierarchy, k-clique, first-order logic, circuit complexity, constant-depth circuits
28Nathan Linial, Yishay Mansour, Noam Nisan Constant Depth Circuits, Fourier Transform, and Learnability. Search on Bibsonomy J. ACM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF AC0 circuits, harmonic analysis learning, complexity, approximation, Boolean functions
22Joseph Slote Parity vs. AC0 with Simple Quantum Preprocessing. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
22Vinayak M. Kumar Tight Correlation Bounds for Circuits Between AC0 and TC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
22Stefan Göller, Nathan Grosshans The AC0-Complexity Of Visibly Pushdown Languages. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Xin Lyu 0003 Improved Pseudorandom Generators for AC0 Circuits. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Vinayak M. Kumar Tight Correlation Bounds for Circuits Between AC0 and TC0. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Joseph Slote Parity vs. AC0 with simple quantum preprocessing. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Vinayak M. Kumar Tight Correlation Bounds for Circuits Between AC0 and TC0. Search on Bibsonomy CCC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Michaël Cadilhac, Charles Paperman The regular languages of wire linear AC0. Search on Bibsonomy Acta Informatica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Xin Lyu 0002 Improved Pseudorandom Generators for AC0 Circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
22Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar Criticality of AC0-Formulae. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
22Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar Criticality of AC0 formulae. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Xuangui Huang, Peter Ivanov, Emanuele Viola Affine Extractors and AC0-Parity. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Mark Bun, Justin Thaler The Large-Error Approximate Degree of AC0. Search on Bibsonomy Theory Comput. The full citation details ... 2021 DBLP  BibTeX  RDF
22Xuangui Huang, Peter Ivanov, Emanuele Viola Affine extractors and AC0-Parity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2021 DBLP  BibTeX  RDF
22Emanuele Viola AC0 Unpredictability. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Yuval Filmus, Or Meir, Avishay Tal Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract). Search on Bibsonomy ITCS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Emanuele Viola New lower bounds for probabilistic degree and AC0 with parity gates. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2020 DBLP  BibTeX  RDF
22Yuval Filmus, Or Meir, Avishay Tal Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2020 DBLP  BibTeX  RDF
22Max Bannach, Till Tantau Computing Hitting Set Kernels By AC0-Circuits. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
22Yuval Filmus, Or Meir, Avishay Tal Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
22Mark Bun, Justin Thaler A Nearly Optimal Lower Bound on the Approximate Degree of AC0. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
22Oded Goldreich 0001, Guy N. Rothblum Constant-Round Interactive Proof Systems for AC0[2] and NC1. Search on Bibsonomy Computational Complexity and Property Testing The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
22Shion Samadder Chaudhury, Sabyasachi Dutta, Kouichi Sakurai AC0 Constructions of Secret Sharing Schemes - Accommodating New Parties. Search on Bibsonomy NSS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
22Benjamin Rossman, Srikanth Srinivasan 0001 Separation of AC0[⊕] Formulas and Circuits. Search on Bibsonomy Theory Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal AC0[p] Lower Bounds against MCSP via the Coin Problem. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2019 DBLP  BibTeX  RDF
22Aditya Potukuchi On the AC0[⊕] complexity of Andreev's Problem. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2019 DBLP  BibTeX  RDF
22Aditya Potukuchi On the AC0[⊕] complexity of Andreev's Problem. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
22 AC0 Constructions for Evolving Secret Sharing Schemes and Redistribution of Secret Shares. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2019 DBLP  BibTeX  RDF
22Yijia Chen, Jörg Flum Some lower bounds in parameterized AC0. Search on Bibsonomy Inf. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal AC0[p] Lower Bounds Against MCSP via the Coin Problem. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Alexander A. Sherstov, Pei Wu Near-optimal lower bounds on the threshold degree and sign-rank of AC0. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan 0001, Utkarsh Tripathi, S. Venkitesh A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Mark Bun, Justin Thaler The Large-Error Approximate Degree of AC0. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
22Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie 0002 AC0∘MOD2 lower bounds for the Boolean Inner Product. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
22Oded Goldreich 0001, Guy N. Rothblum Constant-round interactive proof systems for AC0[2] and NC1. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2018 DBLP  BibTeX  RDF
22Emanuele Viola AC0 unpredictability. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2018 DBLP  BibTeX  RDF
22Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2018 DBLP  BibTeX  RDF
22Mark Bun, Justin Thaler The Large-Error Approximate Degree of AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2018 DBLP  BibTeX  RDF
22Benjamin Rossman Subspace-Invariant AC0 Formulas. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
22Kuan Cheng, Xin Li 0006 Randomness Extraction in AC0 and with Small Locality. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
22Mark Bun, Justin Thaler A Nearly Optimal Lower Bound on the Approximate Degree of AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2017 DBLP  BibTeX  RDF
22Benjamin Rossman, Srikanth Srinivasan 0001 Separation of AC0[⊕] Formulas and Circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2017 DBLP  BibTeX  RDF
22Mark Bun, Justin Thaler A Nearly Optimal Lower Bound on the Approximate Degree of AC0. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
22Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2017 DBLP  BibTeX  RDF
22Kuan Cheng, Yuval Ishai, Xin Li 0006 Near-Optimal Secret Sharing and Error Correcting Codes in AC0. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2017 DBLP  BibTeX  RDF
22Yuan Li, Alexander A. Razborov, Benjamin Rossman On the AC0 Complexity of Subgraph Isomorphism. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
22Ning Ding 0001, Yanli Ren, Dawu Gu Learning AC0 Under k-Dependent Distributions. Search on Bibsonomy TAMC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
22Mark Bun, Justin Thaler A Nearly Optimal Lower Bound on the Approximate Degree of AC0. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
22Avishay Tal Tight Bounds on the Fourier Spectrum of AC0. Search on Bibsonomy CCC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
22Mark Bun, Justin Thaler Improved Bounds on the Sign-Rank of AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
22Srikanth Srinivasan 0001 On Polynomial Approximations to AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
22Kuan Cheng, Xin Li 0006 Randomness Extraction in AC0 and with Small Locality. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
22Arnaud Durand 0001, Anselm Haak, Juha Kontinen, Heribert Vollmer Descriptive Complexity of #AC0 Functions. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
22Yijia Chen, Jörg Flum Some lower bounds in parameterized AC0. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
22Kuan Cheng, Xin Li 0006 Randomness Extraction in AC0 and with Small Locality. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
22Arnaud Durand 0001, Anselm Haak, Juha Kontinen, Heribert Vollmer Descriptive Complexity of #AC0 Functions. Search on Bibsonomy CSL The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
22Stefano Mazzanti Bases for AC0 and Other Complexity Classes. Search on Bibsonomy Fundam. Informaticae The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
22Oded Goldreich 0001, Emanuele Viola, Avi Wigderson On Randomness Extraction in AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2015 DBLP  BibTeX  RDF
22Srikanth Srinivasan 0001 A Compression Algorithm for AC0[⊕] circuits using Certifying Polynomials. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2015 DBLP  BibTeX  RDF
22Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie 0002 AC0 \circ MOD2 lower bounds for the Boolean Inner Product. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2015 DBLP  BibTeX  RDF
22Yuval Filmus, Toniann Pitassi, Rahul Santhanam Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
22Oded Goldreich 0001, Emanuele Viola, Avi Wigderson On Randomness Extraction in AC0. Search on Bibsonomy CCC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
22Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen Candidate weak pseudorandom functions in AC0 ○ MOD2. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2014 DBLP  BibTeX  RDF
22Igor Carboni Oliveira, Rahul Santhanam Majority is incompressible by AC0[p] circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2014 DBLP  BibTeX  RDF
22Yuan Li, Alexander A. Razborov, Benjamin Rossman On the AC0 Complexity of Subgraph Isomorphism. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2014 DBLP  BibTeX  RDF
22Avishay Tal Tight bounds on The Fourier Spectrum of AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2014 DBLP  BibTeX  RDF
22Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen Candidate weak pseudorandom functions in AC0 ○ MOD2. Search on Bibsonomy ITCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
22Yuan Li, Alexander A. Razborov, Benjamin Rossman On the AC0 Complexity of Subgraph Isomorphism. Search on Bibsonomy FOCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
22Jan Krajícek A reduction of proof complexity to computational complexity for AC0[p] Frege systems. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2013 DBLP  BibTeX  RDF
22Zachary Remscrim, Michael Sipser AC0 Pseudorandomness of Natural Operations. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2013 DBLP  BibTeX  RDF
22Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner Graph Isomorphism is Not AC0-Reducible to Group Isomorphism. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
22Luca Trevisan, Tongke Xue A Derandomized Switching Lemma and an Improved Derandomization of AC0. Search on Bibsonomy CCC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
22Paul Beame, Widad Machmouchi The quantum query complexity of AC0. Search on Bibsonomy Quantum Inf. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Swastik Kopparty, Srikanth Srinivasan 0001 Certifying Polynomials for AC0[⊕] circuits, with applications. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2012 DBLP  BibTeX  RDF
22Luca Trevisan A Derandomized Switching Lemma and an Improved Derandomization of AC0. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2012 DBLP  BibTeX  RDF
22Chris Beck, Russell Impagliazzo, Shachar Lovett Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2012 DBLP  BibTeX  RDF
22Russell Impagliazzo, William Matthews, Ramamohan Paturi A satisfiability algorithm for AC0. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 172 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license