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