Chaff engineering an efficient SAT solver

Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Design Automation, 2001 Proceedings s. 530 - 535
Hlavní autoři:	Moskewicz, Matthew W., Madigan, Conor F., Zhao, Ying, Zhang, Lintao, Malik, Sharad
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 01.01.2001 IEEE
Edice:	ACM Conferences
Témata:	Applied computing > Physical sciences and engineering > Engineering Artificial intelligence Business continuity Computer systems organization > Dependable and fault-tolerant systems and networks Design automation Design engineering Electronic design automation and methodology Electronics packaging General and reference > Cross-computing tools and techniques > Performance Hardware > Robustness Logic testing Networks > Network performance evaluation NP-complete problem Performance gain Permission Theory of computation > Computational complexity and cryptography > Interactive proof systems Theory of computation > Computational complexity and cryptography > Proof complexity Theory of computation > Logic > Proof theory boolean satisfiability design verification
ISBN:	1581132972, 9781581132977
ISSN:	0738-100X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!