scientific article; zbMATH DE number 937384
From MaRDI portal
Publication:4896525
zbMath0855.03033MaRDI QIDQ4896525
Publication date: 9 February 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitybounded arithmeticprovably total functionsweak theories of arithmeticstring language\(AC^ 0\)binary string notation
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)
This page was built for publication:
