Complexity of Reasoning in Kleene Algebra with Sum-of-Letters Hypotheses

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Complexity of Reasoning in Kleene Algebra with Sum-of-Letters Hypotheses
Συγγραφείς:	Kuznetsov, Stepan L.^{Aff10, Aff11}
Συνεισφορές:	Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Biere, Armin, editor^Aff7, Lutz, Carsten, editor^Aff8, Negri, Sara, editor^Aff9
Πηγή:	Automated Reasoning : 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part II. 16689:161-177
Βάση Δεδομένων:	Springer Nature eBooks

Περιγραφή
ISBN:	9783032325914 9783032325921
DOI:	10.1007/978-3-032-32592-1_10