scientific article; zbMATH DE number 512904

MaRDI QIDQ4281612zbMATH OpenFDO

Authors Alexandre Dikovsky

Publication date 31 August 1994

zbMATH Keywords

Prologtime and space complexityWarren's abstract machine

Mathematics Subject Classification ID

Theory of programming languages (68N15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On computational complexity of Prolog programs
• A verified prolog compiler for the Warren Abstract Machine
• Equivalence of propositional Prolog programs
• scientific article; zbMATH DE number 4178773

Cited in

(5)

• On computational complexity of Prolog programs
• Biography of Alexandre Dikovsky
• scientific article; zbMATH DE number 4130365 (Why is no real title available?)
• scientific article; zbMATH DE number 4178773 (Why is no real title available?)
• Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming

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 Q4281612)