Computing the Minimum Fill-In is NP-Complete
From MaRDI portal
Publication:3960122
DOI10.1137/0602010zbMATH Open0496.68033OpenAlexW2027566319MaRDI QIDQ3960122
Author name not available (Why is that?)
Publication date: 1981
Published in: (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8561d23058501c8f2c245bffb3001e488192a7a3
No records found.
No records found.
This page was built for publication: Computing the Minimum Fill-In is NP-Complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960122)
