Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
From MaRDI portal
Publication:5501928
DOI10.1145/2629620zbMATH Open1321.68274OpenAlexW2034437384WikidataQ130962558 ScholiaQ130962558MaRDI QIDQ5501928
Author name not available (Why is that?)
Publication date: 14 August 2015
Published in: (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2504/
No records found.
No records found.
This page was built for publication: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501928)
