MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Evgeny Dantsin, Alexander Wolpert
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time
ICST, 2006.

SAT 2006
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SAT-2006-DantsinW,
	author        = "Evgeny Dantsin and Alexander Wolpert",
	booktitle     = "{Proceedings of the Ninth International Conference on Theory and Applications of Satisfiability Testing}",
	doi           = "10.1007/11814948_26",
	isbn          = "3-540-37206-7",
	pages         = "266--276",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time}",
	volume        = 4121,
	year          = 2006,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.