Complexity of computations

DOI10.1145/359810.359816zbMath0355.68037DBLPjournals/cacm/Rabin77OpenAlexW2073034253WikidataQ56067340 ScholiaQ56067340MaRDI QIDQ4127384

Michael O. Rabin

Publication date: 1977

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359810.359816

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS ⋮ Uniform complexity and digital signatures ⋮ Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem

This page was built for publication: Complexity of computations