scientific article; zbMATH DE number 4178773

MaRDI QIDQ3201760zbMATH OpenFDO

Authors Hans Kleine Büning, Ulrich Löwen

Publication date 1990

zbMATH Keywords

lower boundstime complexityProlog programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 4110071
• On computational complexity of Prolog programs
• scientific article; zbMATH DE number 3995082
• Equivalence of propositional Prolog programs
• scientific article; zbMATH DE number 512904

Cited in

(2)

• scientific article; zbMATH DE number 4110071 (Why is no real title available?)
• On computational complexity of Prolog programs

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