Exploring the subexponential complexity of completion problems
From MaRDI portal
Publication:2828210
DOI10.1145/2799640zbMATH Open1347.68180OpenAlexW2243582562WikidataQ60488388 ScholiaQ60488388MaRDI QIDQ2828210
Author name not available (Why is that?)
Publication date: 24 October 2016
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2799640
No records found.
No records found.
This page was built for publication: Exploring the subexponential complexity of completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828210)
