Ein Modell des P=NP-Problems mit einer positiven Lösung

DOI10.1007/BF00288972zbMath0496.03023OpenAlexW2286702516MaRDI QIDQ1170237

Hagen Huwig

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288972

zbMATH Keywords

category of semigroupsindependence of P=NPpolynomial-time computable homomorphisms

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

A note on inconsistencies caused by fixpoints in a cartesian closed category

Cites Work

• Topoi. The categorial analysis of logic
• Some definitional suggestions for automata theory
• Subrecursiveness: Machine-independent notions of computability in restricted time and storage
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ein Modell des P=NP-Problems mit einer positiven Lösung