scientific article
From MaRDI portal
Publication:4003357
zbMath0755.68003MaRDI QIDQ4003357
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsundecidabilityparallelismprobabilistic algorithmsprogramming languagesconcurrencydataintractabilityinefficiencyalgorithmic methodscorrectness of algorithmsefficiency of algorithmsnoncomputability
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Q99)
Related Items (10)
On the solvability of domino snake problems ⋮ Foundations of Boolean stream runtime verification ⋮ Optimal multi-file read policies for optical discs ⋮ Computer Science Unplugged and Related Projects in Math and Computer Science Popularization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Which fragments of the interval temporal logic HS are tractable in model checking? ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments ⋮ Complexity issues for timeline-based planning over dense time under future and minimal semantics
Uses Software
This page was built for publication:
