scientific article; zbMATH DE number 3990861

zbMATH Open0612.68034MaRDI QIDQ3753480FDOQ3753480

Authors: José L. Balcázar, Joaquim Gabarró, J. Díaz 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• On characterizations of the class PSPACE/poly
• Logarithmic advice classes
• The structure of logarithmic advice complexity classes
• On bounded query machines
• A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity

zbMATH Keywords

Kolmogorov complexitynon-uniform complexity classPSPACE/polyoracle machinesPSPACE-complete setsparallel straight-line programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Non-uniqueness of topology for algebras of polynomials
• On characterizations of the class PSPACE/poly
• A survey of space complexity
• Computational depth: Concept and applications

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 Q3753480)