Work

Polynomial Collapse of a Planar NP-Complete Subclass in the Classical sigma-Calculus

Year: 2025

Type: article

Abstract: We exhibit Planar Monotone 1-in-3 SAT instances which are NP-complete for Turingmachines yet collapse in O(n2) time inside the classical sigma sector.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.15449575

Author: Sievers, Oliver

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6911782572

FWCI:

Cites:

Cited by:

Related to: