{"id":"https://openalex.org/W2050572571","doi":"https://doi.org/10.1016/s1571-0653(04)00461-5","title":"Recognizing more random unsatisfiable 3-SAT instances efficiently","display_name":"Recognizing more random unsatisfiable 3-SAT instances efficiently","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2050572571","doi":"https://doi.org/10.1016/s1571-0653(04)00461-5","mag":"2050572571"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0653(04)00461-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1571-0653(04)00461-5","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Discrete Mathematics","raw_type":"journal-article"},"type":"article","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/A5044686377","display_name":"Andreas Goerdt","orcid":null},"institutions":[{"id":"https://openalex.org/I2610724","display_name":"Chemnitz University of Technology","ror":"https://ror.org/00a208s56","country_code":"DE","type":"education","lineage":["https://openalex.org/I2610724"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Goerdt","raw_affiliation_strings":["Technische Universit\u00e4t Chemnitz, Fakult\u00e4t f\u00fcr Informatik Stra\u03b2e der Nationen 62,09107 Chemnitz, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Chemnitz, Fakult\u00e4t f\u00fcr Informatik Stra\u03b2e der Nationen 62,09107 Chemnitz, Germany","institution_ids":["https://openalex.org/I2610724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055693000","display_name":"Andr\u00e9 Lanka","orcid":null},"institutions":[{"id":"https://openalex.org/I2610724","display_name":"Chemnitz University of Technology","ror":"https://ror.org/00a208s56","country_code":"DE","type":"education","lineage":["https://openalex.org/I2610724"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andr\u00e9 Lanka","raw_affiliation_strings":["Technische Universit\u00e4t Chemnitz, Fakult\u00e4t f\u00fcr Informatik Stra\u03b2e der Nationen 62,09107 Chemnitz, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Chemnitz, Fakult\u00e4t f\u00fcr Informatik Stra\u03b2e der Nationen 62,09107 Chemnitz, Germany","institution_ids":["https://openalex.org/I2610724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044686377","https://openalex.org/A5055693000"],"corresponding_institution_ids":["https://openalex.org/I2610724"],"apc_list":null,"apc_paid":null,"fwci":2.2322,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.90271049,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"16","issue":null,"first_page":"21","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.979200005531311,"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.965499997138977,"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/constant","display_name":"Constant (computer programming)","score":0.654908299446106},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.627508819103241},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.590800404548645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5726728439331055},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47567999362945557},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4224509000778198},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4005427956581116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29373714327812195}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.654908299446106},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.627508819103241},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.590800404548645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5726728439331055},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47567999362945557},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4224509000778198},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4005427956581116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29373714327812195},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0653(04)00461-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1571-0653(04)00461-5","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.6982","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scs.carleton.ca/~kranakis/LICS-03/random3SAT.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1491700082","https://openalex.org/W1509033957","https://openalex.org/W1537654681","https://openalex.org/W1559492868","https://openalex.org/W1578099820","https://openalex.org/W1615067155","https://openalex.org/W2021145763","https://openalex.org/W2026709222","https://openalex.org/W2072802070","https://openalex.org/W2088164510","https://openalex.org/W2133747498","https://openalex.org/W2587774887","https://openalex.org/W4230962939","https://openalex.org/W4285719527","https://openalex.org/W6629398430","https://openalex.org/W6630481853","https://openalex.org/W6632116933","https://openalex.org/W6635478059","https://openalex.org/W6656908887"],"related_works":["https://openalex.org/W2075335084","https://openalex.org/W2964263244","https://openalex.org/W1983915440","https://openalex.org/W2158905189","https://openalex.org/W4319874546","https://openalex.org/W3095925971","https://openalex.org/W3037419933","https://openalex.org/W44982509","https://openalex.org/W2952234674","https://openalex.org/W1543051890"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}