scientific article

zbMATH Open0662.03037MaRDI QIDQ3812229

José L. Balcázar, Ricard Gavaldà

Publication date: 1988

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

zbMATH Keywords

sparse setstally setscoNPNP/Polypolynomial time hierarchynondeterministic machinesZPPnonuniform complexity class P/Polypolynomial size Boolean circuits

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)

Related Items (4)

Title not available (Why is that?) ⋮ Robustness of PSPACE-complete sets ⋮ Separating complexity classes with tally oracles ⋮ Title not available (Why is that?)

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