scientific article; zbMATH DE number 18636

MaRDI QIDQ3976040zbMATHFDO

Authors Friedhelm Meyer auf der Heide, Marek Karpinski

Publication date 26 June 1992

zbMATH Keywords

separationrandom access machinesnonuniform computation models

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On genuinely time bounded computations
• scientific article; zbMATH DE number 827987
• On the complexity of functions for random access machines
• scientific article; zbMATH DE number 1257074
• Parallelism in random access machines

Cited in

(10)

• The black-box query complexity of polynomial summation
• On the cell probe complexity of polynomial evaluation
• On the complexity of the computation of certain classes of polynomials of several variables
• scientific article; zbMATH DE number 3932433 (Why is no real title available?)
• scientific article; zbMATH DE number 6796098 (Why is no real title available?)
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• On solving hard problems by polynomial-size circuits
• scientific article; zbMATH DE number 827987 (Why is no real title available?)
• scientific article; zbMATH DE number 1760347 (Why is no real title available?)
• On genuinely time bounded computations

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