scientific article
From MaRDI portal
Publication:3817599
zbMath0666.68032MaRDI QIDQ3817599
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel complexityP-completenessMostowski epimorphismprogramming language SETLreplacement construct
Analysis of algorithms and problem complexity (68Q25) Applications of set theory (03E75) General topics in the theory of software (68N01)
Related Items (3)
\(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability ⋮ Hereditarily-finite sets, data bases and polynomial-time computability
This page was built for publication: