Satisfiability with Exponential Families

DOI10.1007/978-3-540-72788-0_17zbMath1214.68181OpenAlexW2095678014WikidataQ56475824 ScholiaQ56475824MaRDI QIDQ3612463

Philipp Zumstein, Dominik Scheder

Publication date: 10 March 2009

Published in: Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)

Full work available at URL: https://madoc.bib.uni-mannheim.de/41138/2/ssat-postprint.pdf

zbMATH Keywords

VC-dimensioncontext-free grammarssatisfiabilityNP-hardnesspolynomial circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Satisfiability with Exponential Families