scientific article; zbMATH DE number 1072527

MaRDI QIDQ4359454zbMATH OpenFDO

Authors David Mix Barrington, Neil Immerman

Publication date 8 October 1997

zbMATH Keywords

orthogonal complexity measures

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1978903
• Complexity theory of parallel time and hardware
• Descriptive characterizations of computational complexity
• Uniform characterizations of non-uniform complexity measures
• Expressibility and Parallel Complexity

Cited in

(6)

• A constant-space sequential model of computation for first-order logic
• Relating polynomial time to constant depth
• The computational complexity of the Lorentz lattice gas
• scientific article; zbMATH DE number 1978903 (Why is no real title available?)
• On the complexity of some problems on groups input as multiplication tables
• A constant-space sequential model of computation for first-order logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359454)