On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
Download
Permanent link
https://doi.org/10.3929/ethz-a-010887450Publication status
publishedExternal links
Search via SFX
Publisher
ETH-ZürichSubject
HORNKLAUSELN (MATHEMATISCHE LOGIK); KOMBINATORISCHE PROBLEME (DISKRETE OPTIMIERUNG); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); HORN CLAUSES (MATHEMATICAL LOGIC); COMBINATORIAL PROBLEMS (DISCRETE PROGRAMMING); ALGORITHMIC COMPLEXITY (MATHEMATICS)Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Notes
Combinatorial Algorithms. 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, LNCS 8288. pp. 54-66, 2013.More
Show all metadata
ETH Bibliography
yes
Altmetrics