scientific article; zbMATH DE number 18636

zbMATH Open0747.68017MaRDI QIDQ3976040FDOQ3976040

Authors: Friedhelm Meyer auf der Heide, Marek Karpinski 

Publication date: 26 June 1992

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

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

zbMATH Keywords

separationrandom access machinesnonuniform computation models

Mathematics Subject Classification ID

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

Cited In (10)

• On the complexity of the computation of certain classes of polynomials of several variables
• On solving hard problems by polynomial-size circuits
• Title not available (Why is that?)
• On genuinely time bounded computations
• The black-box query complexity of polynomial summation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the cell probe complexity of polynomial evaluation

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)