scientific article; zbMATH DE number 4178773

zbMATH Open0715.68039MaRDI QIDQ3201760FDOQ3201760

Hans Kleine Büning, Ulrich Löwen

Publication date: 1990

Title of this publication is not available (Why is that?)

zbMATH Keywords

lower boundstime complexityProlog programs

Mathematics Subject Classification ID

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

Cited In (1)

• On computational complexity of Prolog programs

   Recommendations

• Title not available (Why is that?) 👍 👎
• On computational complexity of Prolog programs 👍 👎
• Title not available (Why is that?) 👍 👎
• Equivalence of propositional Prolog programs 👍 👎
• Title not available (Why is that?) 👍 👎

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)