scientific article; zbMATH DE number 223337
From MaRDI portal
Publication:5285981
zbMath0782.68050MaRDI QIDQ5285981
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
Capturing complexity classes with Lindström quantifiers ⋮ Succinctness as a source of complexity in logical formalisms ⋮ On the complexity of data disjunctions. ⋮ Context-sensitive transitive closure operators
This page was built for publication: