scientific article; zbMATH DE number 194513
From MaRDI portal
Publication:4692470
zbMath0734.68020MaRDI QIDQ4692470
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilityprobabilistic algorithmsintractabilityparallelism and concurrencycorrectness of algorithmsefficiency of algorithmsnoncomputability
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) General topics in the theory of software (68N01)
Related Items (1)
This page was built for publication: