Yaroslav Alekseev

Orcid: 0000-0003-3196-6919

According to our database1, Yaroslav Alekseev authored at least 15 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Linear Matroid Intersection is in Catalytic Logspace.
CoRR, September, 2025

Approximate polymorphisms of predicates.
Electron. Colloquium Comput. Complex., 2025

Lifting to Bounded-Depth and Regular Resolutions over Parities via Games.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Tropical Proof Systems: Between R(CP) and Resolution.
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Catalytic Computing and Register Programs Beyond Log-Depth.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Generalised Linial-Nisan Conjecture Is False for DNFs.
Proceedings of the 40th Computational Complexity Conference, 2025

2024
ATSM: A coverage-based framework and a tool for test suite minimization.
J. Softw. Evol. Process., June, 2024

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

Lifting to regular resolution over parities via games.
Electron. Colloquium Comput. Complex., 2024

Tropical proof systems.
Electron. Colloquium Comput. Complex., 2024

Lifting Dichotomies.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
The Power of the Binary Value Principle.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2021
A Lower Bound for Polynomial Calculus with Extension Rule.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?
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?
Electron. Colloquium Comput. Complex., 2019


  Loading...