Optimal length refutations of linear programs in selected proof systems under the ADD inference rule
Annals of Mathematics and Artificial Intelligence · 17.03.2026
DOI: 10.1007/s10472-025-10000-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Mathematics and Artificial Intelligence, online erschienen am 17.03.2026. Verfasst von K. Subramani und 1 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Gefördert von: Defense Sciences Office, DARPA,United States.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Defense Sciences Office, DARPA,United States
Zitieren
APA
Subramani, K., & Wojciechowski, P. (2026). Optimal length refutations of linear programs in selected proof systems under the ADD inference rule. Annals of Mathematics and Artificial Intelligence. https://doi.org/10.1007/s10472-025-10000-2
Vancouver
Subramani K, Wojciechowski P. Optimal length refutations of linear programs in selected proof systems under the ADD inference rule. Annals of Mathematics and Artificial Intelligence. 2026. doi:10.1007/s10472-025-10000-2
BibTeX
@article{Subramani2026,
author = {Subramani, K. and Wojciechowski, Piotr},
title = {Optimal length refutations of linear programs in selected proof systems under the ADD inference rule},
journal = {Annals of Mathematics and Artificial Intelligence},
year = {2026},
doi = {10.1007/s10472-025-10000-2}
}
EUVIMED