|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 151 occurrences of 102 keywords
|
|
|
Results
Found 253 publication records. Showing 253 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
72 | Jin-yi Cai, D. Sivakumar, Martin Strauss 0001 |
Constant Depth Circuits and the Lutz Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 595-604, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Lutz hypothesis, Exponential Time, constant-depth, nearly exponential-size circuits, circuit complexity theory, computational complexity, pseudorandom generators, complexity classes, NP, constant depth circuits |
68 | Benjamin Rossman |
On the constant-depth complexity of k-clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 721-730, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ac0, bounded variable hierarchy, k-clique, first-order logic, circuit complexity, constant-depth circuits |
63 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 128-139, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Constant Depth, Lower Bounds, Separations, Arithmetic Circuits |
62 | Jin-yi Cai |
Lower Bounds for Constant Depth Circuits in the Presence of Help Bits ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 532-537, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
help bit, arbitrary Boolean function, exponential lower bound, parity functions, random oracle separation, constant depth circuits, constant depth circuit, PSPACE, PH |
61 | Manindra Agrawal, Eric Allender, Samir Datta |
On TC0, AC0, and Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 134-148, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
TC/sup 0/, AC/sup 0/, function classes, constant-depth polynomial-size arithmetic circuits, unbounded fanin addition, multiplication gates, constant-depth arithmetic circuits, computational complexity, normal forms, arithmetic circuits, closure properties |
54 | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
Verifying and decoding in constant depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 440-449, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
error-correcting codes, interactive proofs, constant-depth circuits |
52 | Dan Gutfreund, Guy N. Rothblum |
The Complexity of Local List Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 455-468, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
list-decodable codes, constant-depth circuits, locally-decodable codes |
48 | Ran Raz, Amir Shpilka |
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 409-418, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
47 | Emanuele Viola |
On Constructing Parallel Pseudorandom Generators from One-Way Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 183-197, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Pseudorandom generator construction, one-way function, black-box, restriction, constant-depth circuit, noise sensitivity, hardness amplification |
46 | Emanuele Viola |
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 198-209, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Miklos Santha, Christopher B. Wilson |
Polynomial Size Constant Depth Circuits with a Limited Number of Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings, pp. 228-237, 1991, Springer, 3-540-53709-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
43 | Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang 0053 |
Bounds on the Power of Constant-Depth Quantum Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 44-55, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
41 | Ronen Shaltiel, Emanuele Viola |
Hardness amplification proofs require majority. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 589-598, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
amplification, natural proofs, black-box, hardness, average-case complexity, constant-depth circuits, majority |
40 | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu |
Learning a circuit by injecting values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 584-593, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
learning, circuit, gene regulatory network |
40 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(2), pp. 171-207, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
39 | Alexis Maciel, Toniann Pitassi |
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pp. 189-200, 2006, IEEE Computer Society, 0-7695-2631-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Adam R. Klivans |
On the Derandomization of Constant Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 249-260, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Ashok K. Chandra, Steven Fortune, Richard J. Lipton |
Lower Bounds for Constant Depth Circuits for Prefix Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings, pp. 109-117, 1983, Springer, 3-540-12317-2. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
38 | Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka |
Fast and Feasible Periodic Sorting Networks of Constant Depth ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 369-380, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
d-dimensional mesh, periodic sorting networks, constant depth, compare-exchange operations, AKS network, Batcher's networks, comparator network, layout area |
37 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Cryptography with Constant Input Locality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings, pp. 92-110, 2007, Springer, 978-3-540-74142-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Emanuele Viola |
The complexity of constructing pseudorandom generators from hard functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 13(3-4), pp. 147-188, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q01, Subject classification |
32 | Zhouchen Lin, Heung-Yeung Shum |
On the Number of Samples Needed in Light Field Rendering with Constant-Depth Assumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2000 Conference on Computer Vision and Pattern Recognition (CVPR 2000), 13-15 June 2000, Hilton Head, SC, USA, pp. 1588-, 2000, IEEE Computer Society, 0-7695-0662-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Scott Aaronson |
BQP and the polynomial hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 141-150, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
linial-nisan conjecture, quantum complexity classes, fourier analysis, constant-depth circuits |
30 | Michal Koucký 0001, Pavel Pudlák, Denis Thérien |
Bounded-depth circuits: separating wires from gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 257-265, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
communication, complexity, lower bounds, regular languages, wires, constant-depth circuits, gates |
30 | Moni Naor, Omer Reingold |
Number-theoretic constructions of efficient pseudo-random functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(2), pp. 231-262, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
constant-depth threshold circuits, decision Diffie-Hellman, natural proofs, factoring, learning theory, Pseudo-random functions |
30 | Moni Naor, Omer Reingold |
Number-theoretic Constructions of Efficient Pseudo-random Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 458-467, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
number-theoretic constructions, cryptography, cryptographic primitives, constant depth circuits, pseudo-random functions, threshold gates |
29 | Marcin Kik, Miroslaw Kutylowski, Grzegorz Stachowiak |
Periodic Constant Depth Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 201-212, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Mrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi, Ben Lee Volk |
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR24, pp. TR24-043, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
29 | Mrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi, Ben Lee Volk |
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.01965, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
28 | Russell Impagliazzo, Nathan Segerlind |
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(2), pp. 199-218, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Modular counting axioms, Nullstellensatz refutations, propositional proof complexity |
28 | Omer Barkol, Yuval Ishai |
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings, pp. 395-411, 2005, Springer, 3-540-28114-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Hubie Chen |
Arithmetic Constant-Depth Circuit Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 328-337, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Manindra Agrawal |
Hard Sets and Pseudo-random Generators for Constant Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings, pp. 58-69, 2001, Springer, 3-540-43002-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | H. K. Dai 0001 |
The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par, Vol. I ![In: Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume I, pp. 234-242, 1996, Springer, 3-540-61626-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Ingo Wegener, Norbert Wurm, Sang-Zin Yi |
Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 523-529, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
25 | Kei Uchizawa, Eiji Takimoto |
An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 169-178, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Arkadev Chattopadhyay, Avi Wigderson |
Linear Systems over Composite Moduli. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 43-52, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Boolean circuit complexity, modular gates, matrix rigidity, exponential sums, constant-depth circuits |
24 | Paul Beame, Dang-Trinh Huynh-Ngoc |
Multiparty Communication Complexity and Threshold Circuit Size of AC^0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 53-62, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
lower bounds, communication complexity, constant-depth circuits |
24 | Maurice J. Jansen, Kenneth W. Regan |
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 470-481, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives |
24 | Richard Beigel, Alexis Maciel |
Upper and Lower Bounds for Some Depth-3 Circuit Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 149-157, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
constant depth, majority gate, MOD gate, inner product mod 2, threshold circuit |
24 | Wolfgang Maass 0001, Georg Schnitger, Eduardo D. Sontag |
On the Computational Power of Sigmoid versus Boolean Threshold Circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 767-776, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
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 |
24 | Ran Raz |
Elusive functions and lower bounds for arithmetic circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 711-720, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, lower bounds, arithmetic circuits, circuit complexity |
21 | Kazuyuki Amano, Akira Maruoka |
Some Properties of MODm Circuits Computing Simple Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, pp. 227-237, 2003, Springer, 3-540-40176-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
modular circuits, composite modulus, lower bounds, Fourier analysis, symmetric functions |
21 | Peter Høyer, Robert Spalek |
Quantum Circuits with Unbounded Fan-out. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 234-246, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Michael Schmitt 0001 |
Product Unit Neural Networks with Constant Depth and Superlinear VC Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN ![In: Artificial Neural Networks - ICANN 2001, International Conference Vienna, Austria, August 21-25, 2001 Proceedings, pp. 253-258, 2001, Springer, 3-540-42486-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Jan Krajícek |
Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, pp. 85-90, 1997, Springer, 3-540-63437-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
21 | Purnata Ghosal, Om Prakash 0002, B. V. Raghavendra Rao |
On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, pp. 250-261, 2017, Springer, 978-3-319-62388-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Eric Allender, Michal Koucký 0001 |
Amplifying Lower Bounds by Means of Self-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 31-40, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
self-reducibility, lower bounds, circuit complexity |
21 | Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui |
Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 535-544, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano |
Randomized path coloring on binary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 60-71, 2000, Springer, 3-540-67996-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Phuong Nguyen, Stephen A. Cook |
VTC circ: A Second-Order Theory for TCcirc. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pp. 378-387, 2004, IEEE Computer Society, 0-7695-2192-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Andreas Jakoby, Rüdiger Reischuk |
Average Case Complexity of Unbounded Fanin Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 170-, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
17 | Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien |
Lower bounds for circuits with MOD_m gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 709-718, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Dan Gutfreund, Emanuele Viola |
Fooling Parity Tests with Parity Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 381-392, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
A (de)constructive approach to program checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 143-152, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
program testing, program correcting, program checking |
15 | Peter Høyer, Mehdi Mhalla, Simon Perdrix |
Resources Required for Preparing Graph States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 638-649, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Foundations of computing, Algorithms, Quantum Computing |
15 | Gang Li, Steven W. Zucker |
Surface Geometric Constraints for Stereo in Belief Propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (2) ![In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006), 17-22 June 2006, New York, NY, USA, pp. 2355-2362, 2006, IEEE Computer Society, 0-7695-2597-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Zhigang Zhu, Allen R. Hanson, Edward M. Riseman |
Generalized Parallel-Perspective Stereo Mosaics from Airborne Video. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(2), pp. 226-237, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
airborne video analysis, image registration, stereo vision, epipolar geometry, Mosaicing, visual representation, view interpolation |
15 | Zhouchen Lin, Heung-Yeung Shum |
A Geometric Analysis of Light Field Rendering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 58(2), pp. 121-138, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
double image, sampling, light field, image-based modeling and rendering, view interpolation, lumigraph |
15 | Jinxiang Chai, Shing-Chow Chan, Heung-Yeung Shum, Xin Tong 0001 |
Plenoptic sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2000, New Orleans, LA, USA, July 23-28, 2000, pp. 307-318, 2000, ACM, 1-58113-208-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
plenoptic sampling, sampling, image-based rendering, spectral analysis, plenoptic functions |
15 | Mikael Goldmann, Mats Näslund |
The Complexity of Computing Hard Core Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings, pp. 1-15, 1997, Springer, 3-540-63384-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
small-depth circuit, one-way function, Pseudo-randomness |
14 | Joel Rajakumar, James D. Watson, Yi-Kai Liu 0001 |
Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.14607, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Levente Bodnar |
CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.12094, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß |
On the Constant-Depth Circuit Complexity of Generating Quasigroups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.00133, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Mrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi |
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 3901-3918, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Mrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi |
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
14 | Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi |
Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
14 | Bruno Pasqualotto Cavalar, Igor Carboni Oliveira |
Constant-depth circuits vs. monotone circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
14 | Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi |
Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.05044, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Lena Strobl |
Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.03212, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Mrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi |
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.09701, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Jonathan Allcock, Jinge Bao, João F. Doriguello, Alessandro Luongo, Miklos Santha |
Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.08539, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Bruno Pasqualotto Cavalar, Igor C. Oliveira |
Constant-depth circuits vs. monotone circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.06821, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii |
Constant-Depth Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 43:1-43:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Anette Messinger, Michael Fellner, Wolfgang Lechner |
Constant Depth Code Deformations in the Parity Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QCE ![In: IEEE International Conference on Quantum Computing and Engineering, QCE 2023, Bellevue, WA, USA, September 17-22, 2023, pp. 120-130, 2023, IEEE, 979-8-3503-4323-6. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi |
Range Avoidance for Constant Depth Circuits: Hardness and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 65:1-65:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Bruno Pasqualotto Cavalar, Igor C. Oliveira |
Constant-Depth Circuits vs. Monotone Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 29:1-29:37, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan 0001 |
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(4), pp. 1132-1162, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii |
Constant-Depth Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
14 | William Merrill, Ashish Sabharwal, Noah A. Smith |
Saturated Transformers are Constant-Depth Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Assoc. Comput. Linguistics ![In: Trans. Assoc. Comput. Linguistics 10, pp. 843-856, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
14 | William Merrill, Ashish Sabharwal |
Log-Precision Transformers are Constant-Depth Uniform Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.00729, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Jonathan H. A. de Carvalho, Fernando M. de Paula Neto |
Parametrized constant-depth quantum neuron. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.12496, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
14 | Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii |
Constant-Depth Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.08394, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Nutan Limaye, Srikanth Srinivasan 0001, Sébastien Tavenas |
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 53(2), pp. 40-62, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | C. S. Bhargav, Sagnik Dutta, Nitin Saxena 0001 |
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria., pp. 18:1-18:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-256-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Pooya Hatami, William Hoza, Avishay Tal, Roei Tell |
Fooling Constant-Depth Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
14 | Vincent Guigues, Anatoli B. Juditsky, Arkadi Nemirovski |
Constant Depth Decision Rules for multistage optimization under uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 295(1), pp. 223-232, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Timon Barlag, Heribert Vollmer |
A Logical Characterization of Constant-Depth Circuits over the Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information, and Computation - 27th International Workshop, WoLLIC 2021, Virtual Event, October 5-8, 2021, Proceedings, pp. 16-30, 2021, Springer, 978-3-030-88852-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell |
Fooling Constant-Depth Threshold Circuits (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 104-115, 2021, IEEE, 978-1-6654-2055-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
Lifting for Constant-Depth Circuits and Applications to MCSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 44:1-44:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Rahul Ilango |
Constant Depth Formula and Partial Function Versions of MCSP are Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR20, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Timon Barlag, Heribert Vollmer |
A Logical Characterization of Constant-Depth Circuits over the Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.04916, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Nolan J. Coble, Matthew Coudron |
Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.05460, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Alexandru Paler, Oumarou Oumarou, Robert Basmadjian |
Constant Depth Bucket Brigade Quantum RAM Circuits Without Introducing Ancillae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.09340, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Ojas Parekh, Cynthia A. Phillips, Conrad D. James, James B. Aimone |
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.14652, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
14 | Oded Goldreich 0001, Avishay Tal |
On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Complexity and Property Testing ![In: Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation, pp. 306-325, 2020, Springer, 978-3-030-43661-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
The Surprising Power of Constant Depth Algebraic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 591-603, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Rahul Ilango |
Constant Depth Formula and Partial Function Versions of MCSP are Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 424-433, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Roei Tell |
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 28(2), pp. 259-343, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
The Surprising Power of Constant Depth Algebraic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
Displaying result #1 - #100 of 253 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ >>] |
|