Sciweavers

SAT   2009 Theory and Applications of Satisfiability Testing
Wall of Fame | Most Viewed SAT-2009 Paper
SAT
2009
Springer
158views Hardware» more  SAT 2009»
13 years 10 months ago
Beyond CNF: A Circuit-Based QBF Solver
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchu...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source158
2Download preprint from source153
3Download preprint from source132
4Download preprint from source126
5Download preprint from source124
6Download preprint from source121
7Download preprint from source119
8Download preprint from source119
9Download preprint from source118
10Download preprint from source117
11Download preprint from source113
12Download preprint from source113
13Download preprint from source111
14Download preprint from source109
15Download preprint from source108
16Download preprint from source103
17Download preprint from source97
18Download preprint from source95
19Download preprint from source94
20Download preprint from source94
21Download preprint from source94
22Download preprint from source91
23Download preprint from source90
24Download preprint from source87
25Download preprint from source82
26Download preprint from source79