| Publication | Date of Publication | Type |
|---|
| Towards optimal depth-reductions for algebraic formulas | 2024-11-19 | Paper |
| scientific article; zbMATH DE number 7650312 (Why is no real title available?) | 2023-02-03 | Paper |
Balanced and/or trees and linear threshold functions
2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
The shifted partial derivative complexity of elementary symmetric polynomials
Theory of Computing | 2017-10-11 | Paper |
Lower bounds for depth-4 formulas computing iterated matrix multiplication
SIAM Journal on Computing | 2015-10-08 | Paper |
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Monomials in arithmetic circuits: complete problems in the counting hierarchy
Computational Complexity | 2015-07-08 | Paper |
Monomials in arithmetic circuits: complete problems in the counting hierarchy
Computational Complexity | 2015-07-08 | Paper |
Lower bounds for depth 4 formulas computing iterated matrix multiplication
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Computing the Gromov hyperbolicity of a discrete metric space
Information Processing Letters | 2015-05-21 | Paper |
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
Information and Computation | 2015-01-30 | Paper |
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
A deterministic algorithm for fitting a step function to a weighted point-set
Information Processing Letters | 2013-03-20 | Paper |
| Monomials in arithmetic circuits: complete problems in the counting hierarchy | 2012-08-23 | Paper |
The fraction of large random trees representing a given Boolean function in implicational logic
Random Structures & Algorithms | 2012-05-14 | Paper |
Fitting a step function to a point set
Algorithmica | 2011-07-01 | Paper |
Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
Algorithmica | 2011-03-30 | Paper |
Tautologies over implication with negative literals
Mathematical Logic Quarterly | 2010-08-18 | Paper |
On the shape of decomposable trees
Discrete Mathematics | 2009-12-09 | Paper |
Classical and Intuitionistic Logic Are Asymptotically Identical
Computer Science Logic | 2009-03-05 | Paper |
Complexity and Limiting Ratio of Boolean Functions over Implication
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Fitting a Step Function to a Point Set
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Universal relations and {\#}P-completeness
Theoretical Computer Science | 2008-11-18 | Paper |
Lower Bounds for Geometric Diameter Problems
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
On the construction of a family of transversal subspaces over finite fields
Linear Algebra and its Applications | 2008-06-17 | Paper |
A tight lower bound for computing the diameter of a 3D convex polytope
Algorithmica | 2007-11-28 | Paper |
Universal Relations and #P-Completeness
Lecture Notes in Computer Science | 2007-05-02 | Paper |
A degree bound on decomposable trees
Discrete Mathematics | 2006-04-28 | Paper |
Vandermonde matrices, NP-completeness and transversal subspaces
Foundations of Computational Mathematics | 2004-05-27 | Paper |
Quantifier rank for parity of embedded finite models.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1834663 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1775437 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1670874 (Why is no real title available?) | 2001-11-11 | Paper |
Sparse NP-complete problems over the reals with addition
Theoretical Computer Science | 2001-08-20 | Paper |
