{"id":"https://openalex.org/W1607085183","doi":"https://doi.org/10.29007/cvj9","title":"Typical-case complexity and the SAT competitions","display_name":"Typical-case complexity and the SAT competitions","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W1607085183","doi":"https://doi.org/10.29007/cvj9","mag":"1607085183"},"language":"en","primary_location":{"id":"doi:10.29007/cvj9","is_oa":true,"landing_page_url":"https://doi.org/10.29007/cvj9","pdf_url":"https://easychair.org/publications/open/c","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/c","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013047474","display_name":"Zolt\u00e1n \u00c1d\u00e1m Mann","orcid":"https://orcid.org/0000-0001-5741-2709"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Zoltan Mann","raw_affiliation_strings":["Department of Computer Science and Information Theory Budapest University of Technology and Economics Magyar tudsok krtja 2., 1117 Budapest, Hungary","Department of Computer Science and Information Theory Budapest University of Technology and Economics Magyar tud\u00f3sok k\u00f6r\u00fatja 2., 1117 Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Theory Budapest University of Technology and Economics Magyar tudsok krtja 2., 1117 Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Computer Science and Information Theory Budapest University of Technology and Economics Magyar tud\u00f3sok k\u00f6r\u00fatja 2., 1117 Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013047474"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":0.1954,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.53768033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"27","issue":null,"first_page":"72","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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.9987999796867371,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.993399977684021,"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/T10142","display_name":"Formal Methods in Verification","score":0.9887999892234802,"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/folklore","display_name":"Folklore","score":0.8486742973327637},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.692841112613678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6835733652114868},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5103899836540222},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49083906412124634},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.473890483379364},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4136829972267151},{"id":"https://openalex.org/keywords/data-science","display_name":"Data science","score":0.3545417785644531},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18823692202568054},{"id":"https://openalex.org/keywords/sociology","display_name":"Sociology","score":0.07255110144615173}],"concepts":[{"id":"https://openalex.org/C105297191","wikidata":"https://www.wikidata.org/wiki/Q36192","display_name":"Folklore","level":2,"score":0.8486742973327637},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.692841112613678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6835733652114868},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5103899836540222},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49083906412124634},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.473890483379364},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4136829972267151},{"id":"https://openalex.org/C2522767166","wikidata":"https://www.wikidata.org/wiki/Q2374463","display_name":"Data science","level":1,"score":0.3545417785644531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18823692202568054},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.07255110144615173},{"id":"https://openalex.org/C19165224","wikidata":"https://www.wikidata.org/wiki/Q23404","display_name":"Anthropology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.29007/cvj9","is_oa":true,"landing_page_url":"https://doi.org/10.29007/cvj9","pdf_url":"https://easychair.org/publications/open/c","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:real.mtak.hu:16019","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400081","display_name":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210140733","host_organization_name":"Library and Information Centre of the Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I4210140733"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":{"id":"doi:10.29007/cvj9","is_oa":true,"landing_page_url":"https://doi.org/10.29007/cvj9","pdf_url":"https://easychair.org/publications/open/c","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G293009331","display_name":null,"funder_award_id":"OTKA 108947","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"},{"id":"https://openalex.org/G7541558665","display_name":null,"funder_award_id":"Bolyai","funder_id":"https://openalex.org/F4320322192","funder_display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia"},{"id":"https://openalex.org/G8284597927","display_name":null,"funder_award_id":"J\u00e1nos Bolyai","funder_id":"https://openalex.org/F4320322192","funder_display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia"},{"id":"https://openalex.org/G8831030931","display_name":null,"funder_award_id":"108947","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"},{"id":"https://openalex.org/G8959004","display_name":null,"funder_award_id":"J\u00e1nos","funder_id":"https://openalex.org/F4320322192","funder_display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320322192","display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","ror":"https://ror.org/02ks8qq67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1607085183.pdf","grobid_xml":"https://content.openalex.org/works/W1607085183.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W11802270","https://openalex.org/W32539537","https://openalex.org/W43305077","https://openalex.org/W230546785","https://openalex.org/W333184999","https://openalex.org/W1485383367","https://openalex.org/W1546325545","https://openalex.org/W1620410031","https://openalex.org/W1794542069","https://openalex.org/W1923495615","https://openalex.org/W1968198053","https://openalex.org/W1972829642","https://openalex.org/W1999823208","https://openalex.org/W2000607613","https://openalex.org/W2088419249","https://openalex.org/W2095709533","https://openalex.org/W2097532582","https://openalex.org/W2111224220","https://openalex.org/W2146409874","https://openalex.org/W2147148915","https://openalex.org/W2153327175","https://openalex.org/W2156219615","https://openalex.org/W2160444875","https://openalex.org/W2407944098","https://openalex.org/W2952623436","https://openalex.org/W2963562272","https://openalex.org/W2990320905","https://openalex.org/W3018680990","https://openalex.org/W4254940581","https://openalex.org/W4300122328","https://openalex.org/W4300185665"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W4285605366","https://openalex.org/W2118943303","https://openalex.org/W3150741540","https://openalex.org/W4253759203","https://openalex.org/W2085380335","https://openalex.org/W2249253838","https://openalex.org/W4381894531","https://openalex.org/W2408080066","https://openalex.org/W2883069340"],"abstract_inverted_index":{"The":[0],"aim":[1],"of":[2,12,30,48,52],"this":[3,64],"paper":[4],"is":[5,71,78],"to":[6],"gather":[7],"insight":[8],"into":[9],"typical-case":[10],"complexity":[11,38],"the":[13,20,23,27,31,53,61,74],"Boolean":[14],"Satisfiability":[15],"(SAT)":[16],"problem":[17],"by":[18],"mining":[19],"data":[21],"from":[22,73],"SAT":[24,32,62],"competitions.":[25],"Specifically,":[26],"statistical":[28],"properties":[29,55],"benchmarks":[33],"and":[34,56,76],"their":[35],"impact":[36],"on":[37],"are":[39,58],"investigated,":[40],"as":[41,43],"well":[42],"connections":[44],"between":[45],"different":[46],"metrics":[47],"complexity.":[49],"While":[50],"some":[51],"investigated":[54],"relationships":[57],"\"folklore\"":[59],"in":[60],"community,":[63],"study":[65],"aims":[66],"at":[67],"scientifically":[68],"showing":[69],"what":[70,77],"true":[72],"folklore":[75],"not.":[79]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}