scientific article; zbMATH DE number 1438912

zbMath0937.68050MaRDI QIDQ4951233

Roman Romanov

Publication date: 4 May 2000

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

zbMATH Keywords

polynomial computabilitycomputational tree

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (1)

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time

This page was built for publication: