乐胖代购免代理版

{"id":"https://openalex.org/W4391467217","doi":"https://doi.org/10.1145/3631908.3631929","title":"On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming","display_name":"On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming","publication_year":2023,"publication_date":"2023-10-19","ids":{"openalex":"https://openalex.org/W4391467217","doi":"https://doi.org/10.1145/3631908.3631929"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631908.3631929","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631908.3631929","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3631908.3631929","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003549623","display_name":"Gregory Morse","orcid":"https://orcid.org/0000-0002-0231-6557"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gregory Morse","raw_affiliation_strings":["Department of Programming Languages and Compilers, Faculty of Informatics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Programming Languages and Compilers, Faculty of Informatics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009713228","display_name":"Tam\u00e1s Kozsik","orcid":"https://orcid.org/0000-0003-4484-9172"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Tam\u00e1s Kozsik","raw_affiliation_strings":["Department of Programming Languages and Compilers, Faculty of Informatics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Programming Languages and Compilers, Faculty of Informatics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":68},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"153"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9963,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9963,"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/T12029","display_name":"DNA and Biological Computing","score":0.9951,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9918,"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/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5350045}],"concepts":[{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.7438938},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6026162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5741271},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5459801},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5350045},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.43692422},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.43179944},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4260555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38532543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38339058},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3315848},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15283325},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1513905}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631908.3631929","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631908.3631929","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631908.3631929","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631908.3631929","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":9,"referenced_works":["https://openalex.org/W1546325545","https://openalex.org/W1988622494","https://openalex.org/W2032508248","https://openalex.org/W2039122980","https://openalex.org/W2133527541","https://openalex.org/W3103676600","https://openalex.org/W4225135444","https://openalex.org/W4226006885","https://openalex.org/W4382703215"],"related_works":["https://openalex.org/W4387971932","https://openalex.org/W4288044863","https://openalex.org/W4285263050","https://openalex.org/W3145758888","https://openalex.org/W3141532631","https://openalex.org/W2936088236","https://openalex.org/W2809690215","https://openalex.org/W2148542302","https://openalex.org/W2131164334","https://openalex.org/W1997660011"],"abstract_inverted_index":{"We":[0,33,50,66],"present":[1],"an":[2,56],"asymptotic":[3],"improvement":[4],"in":[5,95],"the":[6,44,90,104],"number":[7,46],"of":[8,20,47],"variables":[9],"(n":[10],"+":[11],"m\u230alog":[12],"2(k":[13],"\u2212":[14],"1)\u230b)":[15],"required":[16],"for":[17,62,82],"state-of-the-art":[18],"formulation":[19],"(max-)k-SAT":[21],"problems":[22],"when":[23],"encoded":[24],"as":[25],"a":[26,36],"quadratic":[27],"unconstrained":[28],"binary":[29],"optimization":[30],"(QUBO)":[31],"problem.":[32],"further":[34],"show":[35,51,67,89],"variable":[37,85],"reduction":[38,94],"technique":[39],"(max-)3-SAT":[40],"formula":[41],"which":[42,99],"achieves":[43],"optimal":[45,91],"substitution":[48,84,93],"variables.":[49],"optimality":[52],"empirically":[53],"by":[54],"presenting":[55],"integer":[57],"linear":[58],"programming":[59],"(ILP)":[60],"construction":[61,106],"arbitrary":[63,83],"Boolean":[64],"formulas.":[65],"how":[68],"various":[69],"goals":[70],"can":[71,77],"be":[72,78],"encoded,":[73],"and":[74],"this":[75],"model":[76],"generalized":[79],"to":[80],"searching":[81],"functions.":[86],"Lastly,":[87],"we":[88],"high-order":[92],"cubic":[96],"QUBO":[97],"equations":[98],"has":[100],"smaller":[101],"coefficients":[102],"than":[103],"typical":[105],"used.":[107]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4391467217","counts_by_year":[],"updated_date":"2024-12-11T04:32:42.691348","created_date":"2024-02-03"}