scientific article

From MaRDI portal

Revision as of 09:26, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3713561

Jump to:navigation, search

zbMath0587.68005MaRDI QIDQ3713561

Elias Dahlhaus, Johann A. Makowsky

Publication date: 1986

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

zbMATH Keywords

complexity independence query languages computational completeness abstract data types generalized recursion theory SETL high level programming language design programming primitives set oriented programming languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items (5)

\(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Composition aspects of programmology. I ⋮ Query languages for hierarchic databases ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ Some thoughts on computational models: from massive human computing to abstract state machines, and beyond

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3713561&oldid=17213049"