scientific article; zbMATH DE number 4090801

MaRDI QIDQ3817612zbMATH OpenFDO

Authors Jürgen Kämper

Publication date 1988

zbMATH Keywords

complexity measurescomplexity classespolynomial time hierarchynon-uniform proof systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes
• scientific article; zbMATH DE number 1555980
• Some consequences of non-uniform conditions on uniform classes
• Instruction sequence based non-uniform complexity classes
• Nonuniform complexity classes specified by lower and upper bounds

Cited in

(5)

• Instruction sequence based non-uniform complexity classes
• A result relating disjunctive self-reducibility to P-immunity
• scientific article; zbMATH DE number 1555980 (Why is no real title available?)
• scientific article; zbMATH DE number 951900 (Why is no real title available?)
• Strong and robustly strong polynomial-time reducibilities to sparse sets

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