Yaroslav Alekseev

According to our database, Yaroslav Alekseev authored at least 9 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

ATSM: A coverage-based framework and a tool for test suite minimization.

Yaroslav Alekseev, Mikhail Onischuck, Arseniy Zorin, Vitaliy Chernyi, Evgeniy Iliyn, Vladimir M. Itsykson

J. Softw. Evol. Process., June, 2024

Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative?

Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret

SIAM J. Comput., 2024

Lifting to regular resolution over parities via games.

Yaroslav Alekseev, Dmitry Itsykson

Electron. Colloquium Comput. Complex., 2024

Tropical proof systems.

Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch

Electron. Colloquium Comput. Complex., 2024

Lifting dichotomies.

Yaroslav Alekseev, Yuval Filmus, Alexander Smal

Electron. Colloquium Comput. Complex., 2024

2022

The power of the Binary Value Principle.

Yaroslav Alekseev, Edward A. Hirsch

Electron. Colloquium Comput. Complex., 2022

2021

A Lower Bound for Polynomial Calculus with Extension Rule.

Yaroslav Alekseev

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?

Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative?

Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret

Electron. Colloquium Comput. Complex., 2019