A comparative runtime analysis of heuristic algorithms for satisfiability problems

Zhou, Y, He, J ORCID logoORCID: https://orcid.org/0000-0002-5616-4691 and Nie, Q, 2009. A comparative runtime analysis of heuristic algorithms for satisfiability problems. Artificial Intelligence, 173 (2), pp. 240-257. ISSN 0004-3702

Full text not available from this repository.
Item Type: Journal article
Publication Title: Artificial Intelligence
Creators: Zhou, Y., He, J. and Nie, Q.
Publisher: Elsevier
Date: February 2009
Volume: 173
Number: 2
ISSN: 0004-3702
Identifiers:
Number
Type
10.1016/j.artint.2008.11.002
DOI
S0004370208001458
Publisher Item Identifier
1262223
Other
Divisions: Schools > School of Science and Technology
Record created by: Jonathan Gallacher
Date Added: 16 Jan 2020 14:02
Last Modified: 16 Jan 2020 14:02
URI: https://irep.ntu.ac.uk/id/eprint/38995

Actions (login required)

Edit View Edit View

Statistics

Views

Views per month over past year

Downloads

Downloads per month over past year