scientific article; zbMATH DE number 1318517

zbMath0919.03034MaRDI QIDQ4256649

V. Arvind, Martin Mundhenk, Johannes Köbler

Publication date: 8 August 1999

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

Mathematics Subject Classification ID

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

Related Items

Geometric sets of low information content, On monotonous oracle machines, Upper bounds for the complexity of sparse and tally descriptions, Reductions to sets of low information content, Monotonous and randomized reductions to sparse sets, Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets, On hard instances