Fast-Growing Functions and the P vs. NP Question

DOI10.1093/jigpal/jzm034zbMath1156.03038OpenAlexW2015364636MaRDI QIDQ5436986

Francisco Antonio Doria

Publication date: 18 January 2008

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzm034

zbMATH Keywords

computational complexitybusy beaver functionfast-growing functionsP-NP problem

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Fast-Growing Functions and the P vs. NP Question