乐胖代购免代理版

{"id":"https://openalex.org/W2963551170","doi":"https://doi.org/10.4086/toc.2018.v014a015","title":null,"display_name":null,"publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2963551170","doi":"https://doi.org/10.4086/toc.2018.v014a015","mag":"2963551170"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a015","pdf_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023685398","display_name":"Ashley Montanaro","orcid":"https://orcid.org/0000-0001-5640-0343"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ashley Montanaro","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5023685398"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.156,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":58,"citation_normalized_percentile":{"value":0.99997,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9878,"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.9878,"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/backtracking","display_name":"Backtracking","score":0.95038664},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47697744},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.43542743},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.4106388}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.95038664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.57063484},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5551964},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.54658526},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.54195696},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47697744},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47169662},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4554621},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.45187634},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.43542743},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.4106388},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4020821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38058627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35723242},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.34797212},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.31341422},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29851872},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16808742},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.097182065},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.09069395},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a015","pdf_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/ws/files/202776270/Full_text_PDF_final_published_version_.pdf","pdf_url":"https://research-information.bris.ac.uk/ws/files/202776270/Full_text_PDF_final_published_version_.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":["University of Bristol"],"type":"repository"},"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.4086/toc.2018.v014a015","pdf_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"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":56,"referenced_works":["https://openalex.org/W127744604","https://openalex.org/W1496100162","https://openalex.org/W1499143214","https://openalex.org/W1508413598","https://openalex.org/W1518705996","https://openalex.org/W1537532043","https://openalex.org/W1544328127","https://openalex.org/W1549449731","https://openalex.org/W1589045411","https://openalex.org/W1593169756","https://openalex.org/W1727475799","https://openalex.org/W1845765495","https://openalex.org/W1964032471","https://openalex.org/W1975528636","https://openalex.org/W1980458533","https://openalex.org/W1993804709","https://openalex.org/W1998539366","https://openalex.org/W2002372750","https://openalex.org/W2005234139","https://openalex.org/W2006096862","https://openalex.org/W2006290558","https://openalex.org/W2009948449","https://openalex.org/W2014603110","https://openalex.org/W2025956887","https://openalex.org/W2031374990","https://openalex.org/W2033216491","https://openalex.org/W2048572907","https://openalex.org/W2057361103","https://openalex.org/W2058286540","https://openalex.org/W2062897452","https://openalex.org/W2096056318","https://openalex.org/W2098208160","https://openalex.org/W2105614108","https://openalex.org/W2108583516","https://openalex.org/W2109741106","https://openalex.org/W2121124751","https://openalex.org/W2121981260","https://openalex.org/W2124209567","https://openalex.org/W2126442135","https://openalex.org/W2126483728","https://openalex.org/W2127309711","https://openalex.org/W2143677375","https://openalex.org/W2171256340","https://openalex.org/W2237958821","https://openalex.org/W247655530","https://openalex.org/W2494078997","https://openalex.org/W2508700012","https://openalex.org/W2566400626","https://openalex.org/W2609340483","https://openalex.org/W2764347725","https://openalex.org/W2963277272","https://openalex.org/W2963343262","https://openalex.org/W3004545975","https://openalex.org/W3101715799","https://openalex.org/W4226347946","https://openalex.org/W80562455"],"related_works":["https://openalex.org/W4253828685","https://openalex.org/W2913258176","https://openalex.org/W2394027715","https://openalex.org/W2282636749","https://openalex.org/W2021700650","https://openalex.org/W2004425492","https://openalex.org/W2000531666","https://openalex.org/W181880326","https://openalex.org/W1598581090","https://openalex.org/W1538913535"],"abstract_inverted_index":{"$":[0,1],"We":[2],"describe":[3],"a":[4,22,34,42,49,55,61,64,85,88,97,150],"general":[5],"method":[6],"to":[7,41,47,63,84,120,156],"obtain":[8],"quantum":[9,99,115,142,151],"speedups":[10],"of":[11,20,87,130,132,149,154],"classical":[12,56],"algorithms":[13,32],"which":[14,59,101,126],"are":[15,38],"based":[16,145],"on":[17,66,146],"the":[18,103,123,128,133,147,159],"technique":[19],"backtracking,":[21],"standard":[23],"approach":[24],"for":[25],"solving":[26],"constraint":[27],"satisfaction":[28],"problems":[29],"(CSPs).":[30],"Backtracking":[31],"explore":[33],"tree":[35,77],"whose":[36,75],"vertices":[37],"partial":[39,89],"solutions":[40],"CSP":[43,65],"in":[44,139,158],"an":[45],"attempt":[46],"find":[48],"complete":[50],"solution.":[51,90],"Assume":[52],"there":[53,95],"is":[54,96,127,144],"backtracking":[57,160],"algorithm":[58,100,116,143,153],"finds":[60],"solution":[62],"$n$":[67],"variables,":[68],"or":[69],"outputs":[70],"that":[71,94],"none":[72],"exists,":[73],"and":[74],"corresponding":[76,83],"contains":[78],"$T$":[79],"vertices,":[80],"each":[81],"vertex":[82],"test":[86],"Then":[91],"we":[92],"show":[93],"bounded-error":[98],"completes":[102],"same":[104],"task":[105],"using":[106],"$O(\\sqrt{T}":[107],"n^{3/2}":[108],"\\log":[109],"n)$":[110],"tests.":[111],"In":[112],"particular,":[113],"this":[114],"can":[117],"be":[118],"used":[119,138],"speed":[121],"up":[122],"DPLL":[124],"algorithm,":[125],"basis":[129],"many":[131],"most":[134],"efficient":[135],"SAT":[136],"solvers":[137],"practice.":[140],"The":[141],"use":[148],"walk":[152],"Belovs":[155],"search":[157],"tree.":[161]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2963551170","counts_by_year":[{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2024-12-11T20:23:54.079114","created_date":"2019-07-30"}