scientific article; zbMATH DE number 4090801

zbMATH Open0666.68047MaRDI QIDQ3817612FDOQ3817612

Authors: Jürgen Kämper 

Publication date: 1988

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

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

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)

Cited In (4)

• Strong and robustly strong polynomial-time reducibilities to sparse sets
• Title not available (Why is that?)
• A result relating disjunctive self-reducibility to P-immunity
• 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 Q3817612)