scientific article

zbMath0985.03050MaRDI QIDQ2752056

Stanley S. Wainer, Naim Çağman, G. E. Ostrin

Publication date: 7 March 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

provably recursive functionsGrzegorczyk hierarchyslow-growing bounding functionstwo-sorted Peano arithmetic

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Complexity of proofs (03F20)

Related Items (1)

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

This page was built for publication: