The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase depth-2 (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1982-1994 (15) 1995-2003 (15) 2005-2008 (19) 2009-2013 (15) 2015-2024 (16)
Publication types (Num. hits)
article(32) inproceedings(47) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 49 occurrences of 44 keywords

Results
Found 80 publication records. Showing 80 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
33Marios Mavronicolas, Thomas Sauerwald A randomized, o(log w)-depth 2 smoothing network. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF smoothing network, load balancing, probabilistic analysis
32Dmitriy Yu. Cherukhin Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF complexity, lower bound, Boolean function, circuit, depth, cyclic convolution
31Luis Antunes 0002, Lance Fortnow, Dieter van Melkebeek Computational Depth. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Ran Raz, Iddo Tzameret The Strength of Multilinear Proofs. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Subject classification. 03F20, 68Q17, 13P10
23Amir Shpilka, Ilya Volkovich Read-once polynomial identity testing. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits
22Richard Beigel, Jun Tarui On ACC Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF modulus-amplifying polynomials, ACC, depth-2 probabilistic circuits, symmetric gate, depth-2 deterministic circuits, language, root, fan-in, AND gates, leaves
19Emanuele Viola Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates. Search on Bibsonomy CCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Amir Shpilka Affine Projections of Symmetric Polynomials. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Sorin Cotofana, Stamatis Vassiliadis Signed Digit Addition and Related Operations with Threshold Logic. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2000 DBLP  DOI  BibTeX  RDF signed-digit arithmetic, redundant adders, redundant multipliers, neural networks, Computer arithmetic, threshold logic, carry-free addition, signed-digit number representation
15David Buchfuhrer, Christopher Umans The Complexity of Boolean Formula Minimization. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
15Sorin Dan Cotofana, Casper Lageweg, Stamatis Vassiliadis Addition Related Arithmetic Operations via Controlled Transport of Charge. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2005 DBLP  DOI  BibTeX  RDF single electron technology, electron counting, multiplication, SET, addition
15Zeev Dvir, Amir Shpilka Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF depth 3 circuits, locally decodable codes, polynomial identity testing
15Sorin Cotofana, Casper Lageweg, Stamatis Vassiliadis On Computing Addition Related Arithmetic Operations via Controlled Transport of Charge. Search on Bibsonomy IEEE Symposium on Computer Arithmetic The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
15José Fernández Ramos, Alfonso Gago Bohórquez Two Operand Binary Adders with Threshold Logic. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1999 DBLP  DOI  BibTeX  RDF neural networks, logic design, computer arithmetic, Threshold logic, threshold gate, binary adders
15Claudia Bertram-Kretzberg, Thomas Hofmeister Multiple Product Modulo Arbitrary Numbers. Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15C. Greg Plaxton, Torsten Suel A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. Search on Bibsonomy ICALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
14Howard Straubing Semigroups and Languages of Dot-Depth 2. Search on Bibsonomy ICALP The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
13Sudarshan K. Dhall, S. Lakshmivarahan, Chi-Ming Yang On a New Class of Optimal Parallel Prefix Circuits with (Size+Depth) = 2n-2 AND\lceil log n \rceil DEPTH(2 \lceil log n \rceil -3). Search on Bibsonomy ICPP The full citation details ... 1987 DBLP  BibTeX  RDF
12Rajgopal Kannan The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2005 DBLP  DOI  BibTeX  RDF optimal control algorithm, Benes network, rearrangeability
12Marcin Kik, Miroslaw Kutylowski, Grzegorz Stachowiak Periodic Constant Depth Sorting Networks. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
11Vince Grolmusz Separating the Communication Complexities of MOD m and MOD p Circuits Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF GIP function, MOD m circuits, MOD p circuits, depth-2, size-N circuits, k-party communication protocols, communication complexities
11Wolfgang Maass 0001, Georg Schnitger, Eduardo D. Sontag On the Computational Power of Sigmoid versus Boolean Threshold Circuits Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF polynomially bounded weights, sigmoid threshold gates, smooth threshold gates, depth 2 circuits, Boolean threshold circuits, constant size circuits, Boolean threshold gates, polynomial size sigmoid threshold circuits, Boolean functions, computational power, constant depth circuits
8Kristoffer Arnsfelt Hansen Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
8Colin Blundell, Milo M. K. Martin, Thomas F. Wenisch InvisiFence: performance-transparent memory ordering in conventional multiprocessors. Search on Bibsonomy ISCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF parallel programming, memory consistency
8Rudolf Ahlswede, Harout K. Aydinian Sparse Asymmetric Connectors in Communication Networks. Search on Bibsonomy GTIT-C The full citation details ... 2006 DBLP  DOI  BibTeX  RDF fault–tolerant connector, connector, rearrangeable network
8Adam R. Klivans, Alexander A. Sherstov Cryptographic Hardness for Learning Intersections of Halfspaces. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
8Lance Fortnow, Adam R. Klivans Efficient Learning Algorithms Yield Circuit Lower Bounds. Search on Bibsonomy COLT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
8Adam R. Klivans, Amir Shpilka Learning Arithmetic Circuits via Partial Derivatives. Search on Bibsonomy COLT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF learning with queries, PAC learning
8Avi Wigderson, David Zuckerman Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. Search on Bibsonomy Comb. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
8Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). Search on Bibsonomy COLT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
8Dima Grigoriev, Marek Karpinski A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals. Search on Bibsonomy AAECC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
6Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
6Sho Sonoda, Isao Ishikawa, Masahiro Ikeda A unified Fourier slice method to derive ridgelet transform for a variety of depth-2 neural networks. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
6Sayar Karmakar, Anirbit Mukherjee, Theodore Papamarkou Depth-2 neural networks under a data-poisoning attack. Search on Bibsonomy Neurocomputing The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
6Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
6Pranjal Awasthi, Alex Tang, Aravindan Vijayaraghavan Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
6O-joung Kwon, Sang-il Oum Graphs of bounded depth-2 rank-brittleness. Search on Bibsonomy J. Graph Theory The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
6Surbhi Goel, Adam R. Klivans, Pasin Manurangsi, Daniel Reichman 0001 Tight Hardness Results for Training Depth-2 ReLU Networks. Search on Bibsonomy ITCS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
6Pranjal Awasthi, Alex Tang, Aravindan Vijayaraghavan Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations. Search on Bibsonomy NeurIPS The full citation details ... 2021 DBLP  BibTeX  RDF
6Anirbit Mukherjee, Ramchandran Muthukumar Guarantees on learning depth-2 neural networks under a data-poisoning attack. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
6Surbhi Goel, Adam R. Klivans, Pasin Manurangsi, Daniel Reichman 0001 Tight Hardness Results for Training Depth-2 ReLU Networks. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
6Daniel Padé, Stephen A. Fenner, Daniel Grier, Thomas Thierauf Depth-2 QAC circuits cannot simulate quantum parity. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
6Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao 0001, Amir Yehudayoff Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2019 DBLP  BibTeX  RDF
6Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao 0001, Amir Yehudayoff Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
6Murray Elder, Geoffrey Lee, Andrew Rechnitzer Permutations Generated by a Depth 2 Stack and an Infinite Stack in Series are Algebraic. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
6Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2015 DBLP  BibTeX  RDF
6Eric Blais, Li-Yang Tan Approximating Boolean Functions with Depth-2 Circuits. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
6Eric Blais, Li-Yang Tan Approximating Boolean functions with depth-2 circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2013 DBLP  BibTeX  RDF
6Min Jang, Jin Whan Kang, Jong-Hwan Kim 0003, Sang-Hyo Kim Asymptotic analysis of LDPC codes with depth-2 connectivity distributions over BEC. Search on Bibsonomy ISIT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
6Eric Blais, Li-Yang Tan Approximating Boolean Functions with Depth-2 Circuits. Search on Bibsonomy CCC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
6Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider 0003 A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
6Martin Koerwien A complicated omega-stable depth 2 theory. Search on Bibsonomy J. Symb. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
6Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani Improved Pseudorandom Generators for Depth 2 Circuits. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
6Seyed Omid Etesami Pseudorandomness against Depth-2 Circuits and Analysis of Goldreich's Candidate One-Way Function. Search on Bibsonomy 2010   RDF
6Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 The Power of Depth 2 Circuits over Algebras. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2009 DBLP  BibTeX  RDF
6Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani Improved Pseudorandom Generators for Depth 2 Circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2009 DBLP  BibTeX  RDF
6Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 The Power of Depth 2 Circuits over Algebras Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
6Alexander A. Sherstov SeparatingAC0 from Depth-2 Majority Circuits. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
6Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 The Power of Depth 2 Circuits over Algebras. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
6Alexander 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
6Murray Elder Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
6Kazuyuki Amano, Akira Maruoka On the Complexity of Depth-2 Circuits with Threshold Gates. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
6Matthias Krause 0001, Pavel Pudlák On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
6Masahiko Arai An upper bound on the node complexity of depth-2 multilayer perceptrons. Search on Bibsonomy ICNN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
6Noga Alon, Jehoshua Bruck Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
6Matthias Krause 0001, Pavel Pudlák On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 1994 DBLP  BibTeX  RDF
6Matthias Krause 0001, Pavel Pudlák On the computational power of depth 2 circuits with threshold and modulo gates. Search on Bibsonomy STOC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
6Michael Luby, Boban Velickovic, Avi Wigderson Deterministic Approximate Counting of Depth-2 Circuits. Search on Bibsonomy ISTCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
6Roy Meshulam A Geometric Construction of a Superconcentrator of Depth 2. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
6Nicholas Pippenger Superconcentrators of Depth 2. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
4Vladimir V. Podolskii A Uniform Lower Bound on Weights of Perceptrons. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
4Louay Bazzi Polylogarithmic Independence Can Fool DNF Formulas. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
4Vladimir V. Podolskii Perceptrons of Large Weight. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
4Barbara Hammer-Aebi, Kirstine Wilfred Christensen, Haakon Lund, Birger Larsen Users, structured documents and overlap: interactive searching of elements and the influence of context on search behaviour. Search on Bibsonomy IIiX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF context-sensitive information seeking & retrieval, document structure in contextual IIR
4Tsunehiko Kameda, Yi Sun, Luis A. Goddyn An Optimization Problem Related to VoD Broadcasting. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
4Eike Kiltz On the Representation of Boolean Predicates of the Diffie-Hellman Function. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
4Jürgen Forster, Matthias Krause 0001, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. Search on Bibsonomy FSTTCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
4Christian Pacha, Peter Glösekötter, Karl Goser, Uwe Auer, Werner Prost, Franz-Josef Tegude Resonant Tunneling Transistors for Threshold Logic Circuit Applications. Search on Bibsonomy Great Lakes Symposium on VLSI The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
4Jens Knoop Formal Callability and Its Relevance and Application to Interprocedural Data-Flow Analysis. Search on Bibsonomy ICCL The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Formal callability, formal reachability, call graph analysis, program optimization, interprocedural data-flow analysis
4Franck Seynhaeve, Marc Tommasi, Ralf Treinen Grid Structure and Undecidable Constraint Theories. Search on Bibsonomy TAPSOFT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #80 of 80 (100 per page; Change: )
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