| Publication | Date of Publication | Type |
|---|
| New lower bounds against homogeneous non-commutative circuits | 2024-11-19 | Paper |
Learnability can be independent of set theory (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Shadows of Newton polytopes
Israel Journal of Mathematics | 2023-10-23 | Paper |
| Shadows of newton polytopes | 2023-07-12 | Paper |
| Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits | 2022-07-21 | Paper |
On the complexity of computing a random Boolean function over the reals
Theory of Computing | 2020-12-17 | Paper |
On the distribution of runners on a circle
European Journal of Combinatorics | 2020-09-15 | Paper |
On \(\epsilon\)-sensitive monotone computations
Computational Complexity | 2020-09-09 | Paper |
On Hardness of Multilinearization and VNP-Completeness in Characteristic 2
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
| Semantic versus syntactic cutting planes | 2018-01-24 | Paper |
| Circuits with medium fan-in | 2018-01-24 | Paper |
| scientific article; zbMATH DE number 6820278 (Why is no real title available?) | 2017-12-19 | Paper |
A note on monotone real circuits
Information Processing Letters | 2017-12-13 | Paper |
Non-commutative arithmetic circuits with division
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Timed Sets, Functional Complexity, and Computability
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
| Total maps of Turing categories | 2016-05-13 | Paper |
Non-commutative arithmetic circuits with division
Theory of Computing | 2016-02-02 | Paper |
On families of anticommuting matrices
Linear Algebra and its Applications | 2016-01-28 | Paper |
Short Proofs for the Determinant Identities
SIAM Journal on Computing | 2015-06-02 | Paper |
On the real \(\tau\)-conjecture and the distribution of complex roots
Theory of Computing | 2014-10-06 | Paper |
Non-commutative circuits and the sum-of-squares problem
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Short proofs for the determinant identities
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
An asymptotic bound on the composition number of integer sums of squares formulas
Canadian Mathematical Bulletin | 2013-03-07 | Paper |
Homogeneous formulas and symmetric polynomials
Computational Complexity | 2011-11-30 | Paper |
Non-commutative circuits and the sum-of-squares problem
Journal of the American Mathematical Society | 2011-06-27 | Paper |
Arithmetic complexity in ring extensions
Theory of Computing | 2011-05-24 | Paper |
Monotone separations for constant degree polynomials
Information Processing Letters | 2010-09-02 | Paper |
On convex complexity measures
Theoretical Computer Science | 2010-04-15 | Paper |
Kreisel's Conjecture with minimality principle
Journal of Symbolic Logic | 2009-09-29 | Paper |
On lengths of proofs in non-classical logics
Annals of Pure and Applied Logic | 2009-03-25 | Paper |
Lower bounds for modal logics
Journal of Symbolic Logic | 2007-10-17 | Paper |
A lower bound for intuitionistic logic
Annals of Pure and Applied Logic | 2007-04-18 | Paper |
Theories very close to PA where Kreisel's Conjecture is false
Journal of Symbolic Logic | 2007-03-12 | Paper |
