Combined hierarchies of finite random access machines

DOI10.1023/A:1025633804935zbMATH Open1076.68029OpenAlexW19522896MaRDI QIDQ2487387

Anatoly Petrivich Beltiukov

Publication date: 5 August 2005

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025633804935

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

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

Related Items (2)

Title not available (Why is that?) ⋮ Feasible real random access machines

This page was built for publication: Combined hierarchies of finite random access machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487387)