{"id":"https://openalex.org/W2098066196","doi":"https://doi.org/10.1145/800076.802476","title":"Low level complexity for combinatorial games","display_name":"Low level complexity for combinatorial games","publication_year":1981,"publication_date":"1981-01-01","ids":{"openalex":"https://openalex.org/W2098066196","doi":"https://doi.org/10.1145/800076.802476","mag":"2098066196"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/800076.802476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5039810291","display_name":"Akeo Adachi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akeo Adachi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086740888","display_name":"Shigeki Iwata","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shigeki Iwata","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110384616","display_name":"Takumi Kasai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takumi Kasai","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.33,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":5,"citation_normalized_percentile":{"value":0.459799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":73,"max":74},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Game Artificial Intelligence Research","score":0.9983,"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/T11574","display_name":"Game Artificial Intelligence Research","score":0.9983,"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/T10126","display_name":"Program Analysis and Verification Techniques","score":0.9912,"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":"Computational Complexity and Algorithmic Information Theory","score":0.9898,"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/player-modeling","display_name":"Player Modeling","score":0.515135},{"id":"https://openalex.org/keywords/general-game-playing","display_name":"General Game Playing","score":0.506597}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.63595027},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39693284}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/800076.802476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":4,"referenced_works":["https://openalex.org/W1983796355","https://openalex.org/W2002089154","https://openalex.org/W2064336391","https://openalex.org/W2079275582"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2530322880","https://openalex.org/W2390279801","https://openalex.org/W2382290278","https://openalex.org/W2376932109","https://openalex.org/W2358668433","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2001405890"],"abstract_inverted_index":{"There":[0],"have":[1,31],"been":[2,32],"numerous":[3],"attempts":[4],"to":[5,53,89,98],"discuss":[6],"the":[7,51,57,103,107,111,118,142,161,164,176,184,199],"time":[8,135,172],"complexity":[9,177],"of":[10,28,102,109,113,117,166,186,188,198],"problems":[11,30,77],"and":[12,43,48,106,136,183],"classify":[13],"them":[14],"into":[15],"hierarchical":[16],"classes":[17],"such":[18,87],"as":[19,88],"P,":[20],"NP,":[21],"PSPACE,":[22],"EXP,":[23],"etc.":[24],"A":[25,84],"great":[26],"number":[27],"familiar":[29],"reported":[33],"which":[34,78],"are":[35,79],"complete":[36,65,76,80],"in":[37,66,81,133,155,160],"NP":[38,75,99],"(nondeterministic":[39],"polynomial":[40,67,82,131,152],"time).":[41],"Even":[42],"Tarjan":[44],"considered":[45],"generalized":[46],"Hex":[47],"showed":[49],"that":[50],"problem":[52,96,168],"determine":[54,90],"who":[55],"wins":[56],"game":[58,73],"if":[59],"each":[60,149],"player":[61],"plays":[62],"perfectly":[63],"is":[64,100,144],"space.":[68,83],"Shaefer":[69],"derived":[70],"some":[71],"two-person":[72],"from":[74,148],"rough":[85],"discussion":[86,162],"whether":[91,163],"or":[92,173],"not":[93],"a":[94,130,167],"given":[95],"belongs":[97],"independent":[101],"machine":[104,121,181],"model":[105],"way":[108],"defining":[110],"size":[112,143,187],"problems,":[114],"since":[115],"any":[116,127],"commonly":[119],"used":[120],"models":[122,182],"can":[123],"be":[124],"simulated":[125],"by":[126,137,151],"other":[128,150],"with":[129],"loss":[132],"running":[134],"no":[138],"matter":[139],"what":[140],"criteria":[141],"defined,":[145],"they":[146],"differ":[147],"order.":[153],"However,":[154],"precise":[156],"discussion,":[157],"for":[158],"example,":[159],"computation":[165],"requires":[169],"O(n":[170],"k)":[171],"O(nk+l)":[174],"time,":[175],"heavily":[178],"depends":[179],"on":[180],"definition":[185],"problems.":[189],"From":[190],"these":[191],"points,":[192],"we":[193],"introduce":[194],"somewhat":[195],"stronger":[196],"notion":[197],"reducibility.":[200]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2098066196","counts_by_year":[],"updated_date":"2024-12-02T05:31:29.140907","created_date":"2016-06-24"}