scientific article

zbMath1243.68007MaRDI QIDQ3114203

David Harel, Yishai A. Feldman

Publication date: 1 February 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsefficiencyintractabilitycomplexity classes

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Collected or selected works; reprintings or translations of classics (01A75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) History of computer science (68-03) General topics in the theory of algorithms (68W01) General topics in the theory of computing (68Q01)

Related Items (9)

Deliberation scheduling for problem solving in time-constrained environments ⋮ Communication Patterns and Input Patterns in Distributed Computing ⋮ Perfect hashing ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Physical Computability Theses ⋮ Timeline-based planning over dense temporal domains ⋮ What Can be Computed in a Distributed System? ⋮ Introducing probabilities in statecharts to specify reactive systems for performance analysis ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms

This page was built for publication: