„coNP-complete“

Suchergebnisse

6 Treffer

• Minkowski Games
  Le Roux, Stéphane ; Pauly, Arno ; Raskin, Jean-François 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity of Cubical Cofibration Logics I: coNP-Complete Examples
  Rose, Robert ; Licata, Daniel R. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP
  Ehrmanntraut, Anton ; Egidy, Fabian ; Glaßer, Christian 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete
  Litak, Tadeusz ; Wolter, Frank
• A model of the coNP-complete non-Hamilton tour decision problem for directed graphs
  Gismondi, S.J ; Swart, E.R
• Inverse Hamiltonian cycle and inverse 3D-matching are coNP-complete
  Krüger, Michael ; Hempel, Harald 2006 Univ.