{"id":"https://openalex.org/W2028931436","doi":"https://doi.org/10.1142/s1230161208000158","title":"Rigorous Estimation of Computational Complexity for OMV SAT Algorithm","display_name":"Rigorous Estimation of Computational Complexity for OMV SAT Algorithm","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2028931436","doi":"https://doi.org/10.1142/s1230161208000158","mag":"2028931436"},"language":"en","primary_location":{"id":"doi:10.1142/s1230161208000158","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1230161208000158","pdf_url":null,"source":{"id":"https://openalex.org/S27332288","display_name":"Open Systems & Information Dynamics","issn_l":"1230-1612","issn":["1230-1612","1573-1324","1793-7191"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Systems & Information Dynamics","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/A5057077049","display_name":"Satoshi Iriyama","orcid":"https://orcid.org/0000-0002-2803-7783"},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Satoshi Iriyama","raw_affiliation_strings":["Tokyo University of Science, Depertment of Information Science, 8641, Yamasaki, Noda City, Chiba, Japan"],"affiliations":[{"raw_affiliation_string":"Tokyo University of Science, Depertment of Information Science, 8641, Yamasaki, Noda City, Chiba, Japan","institution_ids":["https://openalex.org/I161296585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113861389","display_name":"Masanori Ohya","orcid":null},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masanori Ohya","raw_affiliation_strings":["Tokyo University of Science, Depertment of Information Science, 8641, Yamasaki, Noda City, Chiba, Japan"],"affiliations":[{"raw_affiliation_string":"Tokyo University of Science, Depertment of Information Science, 8641, Yamasaki, Noda City, Chiba, Japan","institution_ids":["https://openalex.org/I161296585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057077049"],"corresponding_institution_ids":["https://openalex.org/I161296585"],"apc_list":null,"apc_paid":null,"fwci":5.1484,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.95010468,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"02","first_page":"173","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9995999932289124,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9921000003814697,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9836000204086304,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6666256785392761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6051117181777954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5759320855140686},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5632845759391785},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5266302227973938},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5125608444213867},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5105611085891724},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4778425395488739},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4165528118610382},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4062761664390564}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6666256785392761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6051117181777954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5759320855140686},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5632845759391785},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5266302227973938},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5125608444213867},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5105611085891724},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4778425395488739},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4165528118610382},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4062761664390564},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1230161208000158","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1230161208000158","pdf_url":null,"source":{"id":"https://openalex.org/S27332288","display_name":"Open Systems & Information Dynamics","issn_l":"1230-1612","issn":["1230-1612","1573-1324","1793-7191"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Systems & Information Dynamics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W16444869","https://openalex.org/W156009831","https://openalex.org/W1547266862","https://openalex.org/W1588126331","https://openalex.org/W1627230931","https://openalex.org/W1978544032","https://openalex.org/W2011039300","https://openalex.org/W2038086892","https://openalex.org/W2084578153","https://openalex.org/W2085466361","https://openalex.org/W2476096155","https://openalex.org/W3103450625","https://openalex.org/W6602743847"],"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/W2883069340","https://openalex.org/W2996462315","https://openalex.org/W2101101130"],"abstract_inverted_index":{"For":[0],"SAT":[1,84],"problem,":[2],"which":[3,51],"is":[4,35],"known":[5],"to":[6,54,57],"be":[7,48,55],"NP-complete,":[8],"Ohya":[9,62],"and":[10,63],"Masuda":[11],"found":[12],"a":[13,17,43],"quantum":[14],"algorithm":[15,85,93],"calculating":[16],"given":[18],"boolean":[19,33],"function":[20,34],"for":[21],"all":[22],"truth":[23],"assignments.":[24],"They":[25],"showed":[26],"that":[27],"we":[28,78],"can":[29,47],"decide":[30],"whether":[31],"this":[32,66,76],"satisfiable":[36],"or":[37],"not":[38],"in":[39,96],"polynomial":[40],"time":[41],"if":[42],"certain":[44],"superposed":[45],"state":[46],"detected":[49],"physically,":[50],"turns":[52],"out":[53],"related":[56],"an":[58],"amplification":[59,67],"process.":[60],"Then":[61],"Volovich":[64],"realized":[65],"by":[68,86],"means":[69],"of":[70,82,91],"chaos":[71],"dynamics":[72],"[4,":[73],"5].":[74,100],"In":[75],"paper,":[77],"study":[79],"the":[80,83,89],"complexity":[81],"rigorously":[87],"counting":[88],"steps":[90],"OMV":[92],"discussed":[94],"previously":[95],"[1,":[97],"2,":[98],"4,":[99]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}