{"id":"https://openalex.org/W160705700","doi":"https://doi.org/10.1007/978-3-642-29700-7_20","title":"The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter","display_name":"The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W160705700","doi":"https://doi.org/10.1007/978-3-642-29700-7_20","mag":"160705700"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-29700-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-29700-7_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5102969600","display_name":"Junping Zhou","orcid":"https://orcid.org/0000-0002-7258-9366"},"institutions":[{"id":"https://openalex.org/I184983240","display_name":"Northeast Normal University","ror":"https://ror.org/02rkvz144","country_code":"CN","type":"education","lineage":["https://openalex.org/I184983240"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Junping Zhou","raw_affiliation_strings":["College of Computer, Northeast Normal University, 130117, Changchun, P.R. China"],"affiliations":[{"raw_affiliation_string":"College of Computer, Northeast Normal University, 130117, Changchun, P.R. China","institution_ids":["https://openalex.org/I184983240"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023555343","display_name":"Minghao Yin","orcid":"https://orcid.org/0000-0002-6226-2394"},"institutions":[{"id":"https://openalex.org/I184983240","display_name":"Northeast Normal University","ror":"https://ror.org/02rkvz144","country_code":"CN","type":"education","lineage":["https://openalex.org/I184983240"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Minghao Yin","raw_affiliation_strings":["College of Computer, Northeast Normal University, 130117, Changchun, P.R. China"],"affiliations":[{"raw_affiliation_string":"College of Computer, Northeast Normal University, 130117, Changchun, P.R. China","institution_ids":["https://openalex.org/I184983240"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102969600"],"corresponding_institution_ids":["https://openalex.org/I184983240"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09479769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9958999752998352,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9930999875068665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.8294792175292969},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6261049509048462},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5608949065208435},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5111001133918762},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.49980735778808594},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4886927902698517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.462338387966156},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44826942682266235},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44402015209198},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4323006868362427},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3463592529296875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3453969359397888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32796335220336914}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8294792175292969},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6261049509048462},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5608949065208435},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5111001133918762},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.49980735778808594},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4886927902698517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.462338387966156},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44826942682266235},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44402015209198},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4323006868362427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3463592529296875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3453969359397888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32796335220336914},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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.1007/978-3-642-29700-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-29700-7_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1564428908","https://openalex.org/W1971464806","https://openalex.org/W1976687866","https://openalex.org/W2009046733","https://openalex.org/W2030227772","https://openalex.org/W2034758366","https://openalex.org/W2089328544","https://openalex.org/W2166566648"],"related_works":["https://openalex.org/W2480084299","https://openalex.org/W2014111643","https://openalex.org/W3107131366","https://openalex.org/W2571882453","https://openalex.org/W4211028879","https://openalex.org/W2076399409","https://openalex.org/W3128448798","https://openalex.org/W4248235708","https://openalex.org/W2408080066","https://openalex.org/W1608133301"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}