Lower Bounds for the Complexity of Functions in a Realistic RAM Model

DOI10.1006/JAGM.1998.0994zbMATH Open0947.68068OpenAlexW2025815986MaRDI QIDQ4719337

Nader H. Bshouty

Publication date: 1 February 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1880/45751

zbMATH Keywords

realistic RAM model

Mathematics Subject Classification ID

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

Related Items (2)

Invariance properties of RAMs and linear time ⋮ Determinism versus nondeterminism for linear time RAMs with memory restrictions

This page was built for publication: Lower Bounds for the Complexity of Functions in a Realistic RAM Model

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