Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

DOI10.1145/1806689.1806725zbMATH Open1293.68132OpenAlexW2058258808WikidataQ130968380 ScholiaQ130968380MaRDI QIDQ2875151

Author name not available (Why is that?)

Publication date: 13 August 2014

Published in: (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2504/

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

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 Q2875151)