Efficient data structures for backtrack search SAT solvers
Efficient data structures for backtrack search SAT solvers
308-315
Lynce, I.
6e8dd88e-03e5-4d38-ab82-a1358fda2768
Marques-Silva, J. P.
89a72f8f-541d-46fc-8bb7-c621f720c991
May 2002
Lynce, I.
6e8dd88e-03e5-4d38-ab82-a1358fda2768
Marques-Silva, J. P.
89a72f8f-541d-46fc-8bb7-c621f720c991
Lynce, I. and Marques-Silva, J. P.
(2002)
Efficient data structures for backtrack search SAT solvers.
International Symposium on Theory and Applications of Satisfiability Testing, Cincinnati, Ohio, United States.
.
Record type:
Conference or Workshop Item
(Paper)
Other
jpms-sat02b.ps
- Other
More information
Published date: May 2002
Additional Information:
Event Dates: May 2002
Venue - Dates:
International Symposium on Theory and Applications of Satisfiability Testing, Cincinnati, Ohio, United States, 2002-05-01
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 262260
URI: http://eprints.soton.ac.uk/id/eprint/262260
PURE UUID: b9fe0aba-daad-4bd1-83b3-5b786cdfc4a1
Catalogue record
Date deposited: 04 Apr 2006
Last modified: 14 Mar 2024 07:08
Export record
Contributors
Author:
I. Lynce
Author:
J. P. Marques-Silva
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics