Yaroslav Alekseev

32 papers A* 2A 6B 1C 1Journal 22
YearRankTypeTitle / Venue / Authors
2026 A conf
Intersection Theorems: A Potential Approach to Proof Complexity Lower Bounds.
ITCS
Yaroslav Alekseev, Nikita Gaevoy
2026 A conf
Linear Matroid Intersection Is in Catalytic Logspace.
ITCS
Aryan Agarwala, Yaroslav Alekseev, Antoine Vinciguerra
2026 J jnl
New Polynomial-Depth Res(+) Lower Bounds.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Nikita Gaevoy
2025 J jnl
Approximate polymorphisms of predicates.
CoRR
Yaroslav Alekseev, Yuval Filmus
2025 J jnl
Approximate polymorphisms of predicates.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Yuval Filmus
2025 B conf
Catalytic Computing and Register Programs Beyond Log-Depth.
MFCS
Yaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra
2025 J jnl
Catalytic Computing and Register Programs Beyond Log-Depth.
CoRR
Yaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra
2025 J jnl
Catalytic Computing and Register Programs Beyond Log-Depth.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra
2025 A conf
Generalised Linial-Nisan Conjecture Is False for DNFs.
CCC
Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan
2025 J jnl
Generalised Linial-Nisan Conjecture is False for DNFs.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan
2025 J jnl
Intersection Theorems: A Potential Approach to Proof Complexity Lower Bounds.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Nikita Gaevoy
2025 J jnl
Lifting Dichotomies.
Comput. Complex.
Yaroslav Alekseev, Yuval Filmus, Alexander V. Smal
2025 A* conf
Lifting to Bounded-Depth and Regular Resolutions over Parities via Games.
STOC
Yaroslav Alekseev, Dmitry Itsykson
2025 J jnl
Linear Matroid Intersection is in Catalytic Logspace.
CoRR
Aryan Agarwala, Yaroslav Alekseev, Antoine Vinciguerra
2025 J jnl
Sampling Permutations with Cell Probes is Hard.
CoRR
Yaroslav Alekseev, Mika Göös, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov
2025 J jnl
Sampling Permutations with Cell Probes is Hard.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Mika Göös, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov
2025 J jnl
The power of the Binary Value Principle.
Ann. Pure Appl. Log.
Yaroslav Alekseev, Edward A. Hirsch
2025 A conf
Tropical Proof Systems: Between R(CP) and Resolution.
STACS
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch
2024 J jnl
ATSM: A coverage-based framework and a tool for test suite minimization.
J. Softw. Evol. Process.
Yaroslav Alekseev, Mikhail Onischuck, Arseniy Zorin, Vitaliy Chernyi, Evgeniy Iliyn, Vladimir M. Itsykson
2024 A conf
Lifting Dichotomies.
CCC
Yaroslav Alekseev, Yuval Filmus, Alexander Smal
2024 J jnl
Lifting dichotomies.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Yuval Filmus, Alexander Smal
2024 J jnl
Lifting to regular resolution over parities via games.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Dmitry Itsykson
2024 J jnl
Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative?
SIAM J. Comput.
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2024 J jnl
Tropical proof systems.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch
2023 C conf
The Power of the Binary Value Principle.
CIAC
Yaroslav Alekseev, Edward A. Hirsch
2022 J jnl
The power of the Binary Value Principle.
CoRR
Yaroslav Alekseev, Edward A. Hirsch
2022 J jnl
The power of the Binary Value Principle.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Edward A. Hirsch
2021 A conf
A Lower Bound for Polynomial Calculus with Extension Rule.
CCC
Yaroslav Alekseev
2020 J jnl
A Lower Bound for Polynomial Calculus with Extension Rule.
CoRR
Yaroslav Alekseev
2020 A* conf
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?
STOC
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2019 J jnl
Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative?
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2019 J jnl
Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?
CoRR
Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret