a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution

DOI10.1145/363647.363697zbMath1320.68164OpenAlexW2074221718WikidataQ124792619 ScholiaQ124792619MaRDI QIDQ2947006

Graham Wrightson, Jörg H. Siekmann

Publication date: 20 September 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363647.363697

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution