scientific article; zbMATH DE number 223336

zbMath0782.68049MaRDI QIDQ5285980

Iain A. Stewart

Publication date: 29 June 1993

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

zbMATH Keywords

descriptive complexity theorylogspace

Mathematics Subject Classification ID

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

Related Items (5)

The complexity class θp2: Recent results and applications in AI and modal logic ⋮ 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: