scientific article; zbMATH DE number 3514981
From MaRDI portal
Publication:4094390
zbMath0328.68043MaRDI QIDQ4094390
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
Stability, sequentiality and demand driven evaluation in dataflow ⋮ A stable programming language ⋮ On the expressive power of first-order boolean functions in PCF ⋮ The sequentially realizable functionals ⋮ Relative definability of boolean functions via hypergraphs ⋮ Decidable verification for reducible timed automata specified in a first order logic with time
