P ≠ NP for all infinite Boolean algebras

DOI10.1002/malq.200310020zbMath1029.68070OpenAlexW2103639755MaRDI QIDQ4804182

Mihai Prunescu

Publication date: 10 April 2003

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200310020

zbMATH Keywords

P-NP-problemcomputability over algebraic structuresinfinite Boolean rings

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Ring-theoretic properties of Boolean algebras (06E20)

Related Items (2)

On the P-NP problem over real matrix rings ⋮ Two situations with unit-cost: ordered abelian semi-groups and some commutative rings

This page was built for publication: P ≠ NP for all infinite Boolean algebras