The generic complexity of the graph triangulation problem

DOI10.17223/20710410/58/10OpenAlexW4318830427MaRDI QIDQ5871443

Alexander N. Rybalov

Publication date: 19 January 2023

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm789

zbMATH Keywords

generic complexitygraph triangulation problem

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic complexity of Presburger arithmetic
• On the strongly generic undecidability of the halting problem
• Generic-case complexity, decision problems in group theory, and random walks.
• Generic hardness of the Boolean satisfiability problem
• Generic complexity of the Diophantine problem
• Generic complexity of undecidable problems
• ON GENERIC COMPLEXITY OF THE VALIDITY PROBLEM FOR BOOLEAN FORMULAS
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS

This page was built for publication: The generic complexity of the graph triangulation problem