scientific article; zbMATH DE number 4090786

MaRDI QIDQ3817599zbMATH OpenFDO

Authors Elias Dahlhaus

Publication date 1988

zbMATH Keywords

Mostowski epimorphismP-completenessparallel complexityprogramming language SETLreplacement construct

Mathematics Subject Classification ID

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

Cited in

(7)

• Hereditarily-finite sets, data bases and polynomial-time computability
• -languages for sets and LOGSPACE computable graph transformers
• Linear ordering on graphs, anti-founded sets and polynomial time computability
• scientific article; zbMATH DE number 4164130 (Why is no real title available?)
• scientific article; zbMATH DE number 3942990 (Why is no real title available?)
• scientific article; zbMATH DE number 3976287 (Why is no real title available?)
• Automatic parallel control structures in SequenceL

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3817599)