{"id":"https://openalex.org/W117707387","doi":"https://doi.org/10.1090/dimacs/035/01","title":"Finding hard instances of the satisfiability problem: A survey","display_name":"Finding hard instances of the satisfiability problem: A survey","alternate_titles":[],"publication_year":1997,"publication_date":"1997-12-09","ids":{"openalex":"https://openalex.org/W117707387","doi":"https://doi.org/10.1090/dimacs/035/01","mag":"117707387"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/035/01","doi":"https://doi.org/10.1090/dimacs/035/01","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/01","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W156009831","display_name":"Satisfiability Problem: Theory and Applications","relationship":"volume"}],"lineage":["https://openalex.org/W117707387","https://openalex.org/W156009831"],"child_works_count":0,"type":"book-chapter","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102046287","display_name":"Stephen Cook","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen Cook","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076523933","display_name":"David G. M. Mitchell","orcid":"https://orcid.org/0000-0002-3544-9225","observed_orcids":["https://orcid.org/0000-0002-3544-9225"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Mitchell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.6504,"has_fulltext":false,"cited_by_count":242,"citation_normalized_percentile":{"value":0.98601761,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"17"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9672999978065491,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9672999978065491,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.013399999588727951,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012600000016391277,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/propositional-satisfiability","display_name":"propositional satisfiability","score":0.9929999709129333},{"id":"https://openalex.org/keywords/sat-problem","display_name":"SAT problem","score":0.5590000152587891},{"id":"https://openalex.org/keywords/hard-instances","display_name":"hard instances","score":0.906000018119812},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"average-case complexity","score":0.7739999890327454},{"id":"https://openalex.org/keywords/random-3-sat","display_name":"random 3-SAT","score":0.6620000004768372},{"id":"https://openalex.org/keywords/satisfiability-threshold","display_name":"satisfiability threshold","score":0.7200000286102295},{"id":"https://openalex.org/keywords/instance-generation","display_name":"instance generation","score":0.625}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7943241596221924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5341339111328125},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48059317469596863},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2870830297470093}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/035/01","doi":"https://doi.org/10.1090/dimacs/035/01","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/01","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.9298","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.9298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utoronto.ca/~mitchell/papers/cook-mitchell.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W156009831","https://openalex.org/W1632662515","https://openalex.org/W2075335084","https://openalex.org/W7096311495","https://openalex.org/W1531464635","https://openalex.org/W7038483722","https://openalex.org/W4983232","https://openalex.org/W2137154807","https://openalex.org/W2050297836"],"abstract_inverted_index":{".":[0],"Finding":[1],"sets":[2],"of":[3,6,10,16,31,42,55,60],"hard":[4,62],"instances":[5,63],"propositional":[7],"satisfiability":[8],"is":[9],"interest":[11],"for":[12,19,52],"understanding":[13],"the":[14,29,32,40,46,58],"complexity":[15],"SAT,":[17],"and":[18,57],"experimentally":[20],"evaluating":[21],"SAT":[22,35],"algorithms.":[23],"In":[24],"discussing":[25],"this":[26],"we":[27],"consider":[28],"performance":[30],"most":[33],"popular":[34],"algorithms":[36],"on":[37],"random":[38],"problems,":[39],"theory":[41],"average":[43],"case":[44],"complexity,":[45],"threshold":[47],"phenomenon,":[48],"known":[49],"lower":[50],"bounds":[51],"certain":[53],"classes":[54],"algorithms,":[56],"problem":[59],"generating":[61],"with":[64],"solutions.":[65]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W117707387","counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
