{"id":"https://openalex.org/W2762633509","doi":"https://doi.org/10.1515/gcc-2017-0008","title":"Generic hardness of the Boolean satisfiability problem","display_name":"Generic hardness of the Boolean satisfiability problem","publication_year":2017,"publication_date":"2017-01-12","ids":{"openalex":"https://openalex.org/W2762633509","doi":"https://doi.org/10.1515/gcc-2017-0008","mag":"2762633509"},"language":"en","primary_location":{"id":"doi:10.1515/gcc-2017-0008","is_oa":false,"landing_page_url":"https://doi.org/10.1515/gcc-2017-0008","pdf_url":null,"source":{"id":"https://openalex.org/S4210228216","display_name":"journal of Groups complexity cryptology","issn_l":"1867-1144","issn":["1867-1144","1869-6104"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321880","host_organization_name":"\u00c9pisciences.org","host_organization_lineage":["https://openalex.org/P4310321880"],"host_organization_lineage_names":["\u00c9pisciences.org"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Groups Complexity Cryptology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5031384998","display_name":"Alexander Rybalov","orcid":"https://orcid.org/0009-0001-8259-6156"},"institutions":[{"id":"https://openalex.org/I20119556","display_name":"Omsk State Technical University","ror":"https://ror.org/01kzjg088","country_code":"RU","type":"education","lineage":["https://openalex.org/I20119556"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander Rybalov","raw_affiliation_strings":["Omsk State Technical University, Prospekt Mira 11, Omsk644050, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Omsk State Technical University, Prospekt Mira 11, Omsk644050, Russia","institution_ids":["https://openalex.org/I20119556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031384998"],"corresponding_institution_ids":["https://openalex.org/I20119556"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17641768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"0","issue":"0","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9453999996185303,"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"}},"topics":[{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9453999996185303,"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/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.8104149103164673},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.7460972666740417},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6899273991584778},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5531210899353027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4877496361732483},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47213536500930786},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.43200910091400146},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4265221953392029},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.42267173528671265},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.4186256527900696},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3686109781265259},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.36562588810920715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32490694522857666},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.24926573038101196},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07018321752548218}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.8104149103164673},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.7460972666740417},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6899273991584778},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5531210899353027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4877496361732483},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47213536500930786},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.43200910091400146},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4265221953392029},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.42267173528671265},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.4186256527900696},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3686109781265259},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.36562588810920715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32490694522857666},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.24926573038101196},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07018321752548218},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1515/gcc-2017-0008","is_oa":false,"landing_page_url":"https://doi.org/10.1515/gcc-2017-0008","pdf_url":null,"source":{"id":"https://openalex.org/S4210228216","display_name":"journal of Groups complexity cryptology","issn_l":"1867-1144","issn":["1867-1144","1869-6104"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321880","host_organization_name":"\u00c9pisciences.org","host_organization_lineage":["https://openalex.org/P4310321880"],"host_organization_lineage_names":["\u00c9pisciences.org"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Groups Complexity Cryptology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2248043649","display_name":null,"funder_award_id":"17-11-01117","funder_id":"https://openalex.org/F4320324099","funder_display_name":"Russian Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W155737957","https://openalex.org/W1980224569","https://openalex.org/W2036265926"],"related_works":["https://openalex.org/W2184010066","https://openalex.org/W2150272262","https://openalex.org/W2044916592","https://openalex.org/W2135610719","https://openalex.org/W2986911904","https://openalex.org/W98542587","https://openalex.org/W1534775143","https://openalex.org/W2111523115","https://openalex.org/W4234414781","https://openalex.org/W66231286"],"abstract_inverted_index":{"Abstract":[0],"It":[1],"follows":[2],"from":[3],"the":[4,10,13],"famous":[5],"result":[6],"of":[7,12],"Cook":[8],"about":[9],"NP-completeness":[11],"Boolean":[14],"satisfiability":[15],"problem":[16,25],"that":[17],"there":[18],"is":[19],"no":[20],"polynomial":[21],"algorithm":[22],"for":[23],"this":[24],"if":[26]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}