Suchergebnisse - "2012 ACM Subject Classification Theory of computation → Complexity theory AND logic"

Ordinal measures of the set of finite multisets

Autoren: Vialard, Isa Laboratoire Méthodes Formelles (LMF) Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay) et al.

Weitere Verfasser: Vialard, Isa Laboratoire Méthodes Formelles (LMF) Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay) et al.

Quelle: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩

Schlagwörter: Well-partial order, program verification, termination, finite multisets, Theory of computation → Program reasoning, Theory of computation → Proof theory, Theory of computation → Logic and verification, 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, [INFO]Computer Science [cs]

Geographisches Schlagwort: Bordeaux, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.09881; ARXIV: 2302.09881

Verfügbarkeit: https://hal.science/hal-04287405
https://hal.science/hal-04287405v1/document
https://hal.science/hal-04287405v1/file/multiset.pdf
https://doi.org/10.4230/LIPIcs

Changing Partitions in Rectangle Decision Lists

Autoren: Mengel, Stefan Centre de Recherche en Informatique de Lens (CRIL) Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS) et al.

Weitere Verfasser: Mengel, Stefan Centre de Recherche en Informatique de Lens (CRIL) Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS) et al.

Quelle: 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
https://hal.science/hal-03864946
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), Meel, Kuldeep S. and Strichman, Ofer, Aug 2022, Haifa, Israel. pp.17:1--17:20, ⟨10.4230/LIPIcs.SAT.2022.17⟩

Schlagwörter: 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, Theory of computation → Proof complexity phrases rectangle decision lists, QBF proof complexity, OBDD, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geographisches Schlagwort: Haifa, Israel

Verfügbarkeit: https://hal.science/hal-03864946
https://hal.science/hal-03864946v1/document
https://hal.science/hal-03864946v1/file/orders.pdf
https://doi.org/10.4230/LIPIcs.SAT.2022.17