{"id":"https://openalex.org/W2125536734","doi":"https://doi.org/10.1109/sct.1989.41826","title":"Turning machines with few accepting computations and low sets for PP","display_name":"Turning machines with few accepting computations and low sets for PP","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-07","ids":{"openalex":"https://openalex.org/W2125536734","doi":"https://doi.org/10.1109/sct.1989.41826","mag":"2125536734"},"language":"en","primary_location":{"id":"doi:10.1109/sct.1989.41826","doi":"https://doi.org/10.1109/sct.1989.41826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1989.41826","pdf_url":null,"source":{"id":"https://openalex.org/S4306420946","display_name":"Structure in Complexity Theory Annual Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2125536734"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5103016415","display_name":"Johannes K\u00f6bler","orcid":"https://orcid.org/0000-0002-1215-7270","observed_orcids":["https://orcid.org/0000-0002-1215-7270"]},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. Kobler","raw_affiliation_strings":["Universit\u00e4t Stuttgart, Stuttgart, Germany","Stuttgart Univ., West Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"Stuttgart Univ., West Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055009733","display_name":"Uwe Sch\u00f6ning","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"U. Schoning","raw_affiliation_strings":["EWH Koblenz, Koblenz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EWH Koblenz, Koblenz, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053366001","display_name":"Seinosuke Toda","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"S. Toda","raw_affiliation_strings":["Department of Computer Sciences, University of Electro-Communications, Chofu, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Electro-Communications, Chofu, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027370903","display_name":"Jacobo Tor\u00e1n","orcid":"https://orcid.org/0000-0003-2168-4969","observed_orcids":["https://orcid.org/0000-0003-2168-4969"]},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"J. Toran","raw_affiliation_strings":["Departamento L.S.I., Universidad Polit\u00e9cnica de Catalunya, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento L.S.I., Universidad Polit\u00e9cnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9056,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.69530926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"208","last_page":"215"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9595000147819519,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9595000147819519,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.020899999886751175,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.012600000016391277,"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/up","display_name":"UP","score":0.7229999899864197},{"id":"https://openalex.org/keywords/few","display_name":"few","score":0.6140000224113464},{"id":"https://openalex.org/keywords/pp","display_name":"PP","score":0.675000011920929},{"id":"https://openalex.org/keywords/lowness","display_name":"lowness","score":0.7139999866485596},{"id":"https://openalex.org/keywords/relativization","display_name":"relativization","score":0.6769999861717224},{"id":"https://openalex.org/keywords/complexity-classes","display_name":"complexity classes","score":0.550000011920929},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"polynomial hierarchy","score":0.7390000224113464}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8686420917510986},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7307060956954956},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.6336910128593445},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5922399163246155},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.58467698097229},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5478472709655762},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5427449345588684},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5263845920562744},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5190949440002441},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.5031985640525818},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.49933338165283203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4406380355358124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4369277358055115},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42084550857543945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39262858033180237},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.3894404172897339},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3422749936580658},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17500829696655273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1663535237312317},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sct.1989.41826","doi":"https://doi.org/10.1109/sct.1989.41826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1989.41826","pdf_url":null,"source":{"id":"https://openalex.org/S4306420946","display_name":"Structure in Complexity Theory Annual Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1485836178","https://openalex.org/W1949885173","https://openalex.org/W1967159037","https://openalex.org/W1975784724","https://openalex.org/W1992972561","https://openalex.org/W1999609654","https://openalex.org/W2006912660","https://openalex.org/W2011042573","https://openalex.org/W2023336906","https://openalex.org/W2024309621","https://openalex.org/W2033323875","https://openalex.org/W2044504659","https://openalex.org/W2059442002","https://openalex.org/W2078096580","https://openalex.org/W2085634981","https://openalex.org/W2153191867","https://openalex.org/W2163323474","https://openalex.org/W2987475227","https://openalex.org/W3036236905","https://openalex.org/W4246781121","https://openalex.org/W4255202909","https://openalex.org/W6640839759"],"related_works":["https://openalex.org/W7025239359","https://openalex.org/W2178192088","https://openalex.org/W2143997771","https://openalex.org/W1982406523","https://openalex.org/W1973852671","https://openalex.org/W2072015126","https://openalex.org/W2021131202","https://openalex.org/W83397938","https://openalex.org/W1985250585","https://openalex.org/W7097931594"],"abstract_inverted_index":{"The":[0,52,98,119],"authors":[1,99],"study":[2],"two":[3,81],"different":[4],"ways":[5],"to":[6,46,124],"restrict":[7],"the":[8,49,79,104,116],"power":[9],"of":[10,24,29,36,63,70,95,103,128],"NP.":[11],"They":[12],"consider":[13],"languages":[14],"accepted":[15],"by":[16],"nondeterministic":[17,64],"polynomial-time":[18,50],"machines":[19,65],"with":[20,66],"a":[21,67,93],"small":[22],"number":[23,69,84],"accepting":[25,71],"paths":[26,72],"in":[27,48,61],"case":[28],"acceptance,":[30],"and":[31,56,89,107],"they":[32],"investigate":[33],"three":[34],"subclasses":[35],"NP":[37],"that":[38,112],"are":[39,58,113,122],"low":[40,114],"for":[41,73,78,115],"complexity":[42,129],"classes":[43,82],"not":[44,86],"known":[45,87],"be":[47],"hierarchy.":[51],"subclasses,":[53],"UP,":[54],"FewP,":[55],"Few,":[57],"all":[59],"defined":[60],"terms":[62],"bounded":[68],"every":[74],"input":[75],"string,":[76],"but":[77],"last":[80],"this":[83],"is":[85],"beforehand":[88],"can":[90],"range":[91],"over":[92],"space":[94],"polynomial":[96],"size.":[97],"prove":[100],"lowness":[101,120],"properties":[102],"class":[105,117],"Few":[106],"some":[108],"other":[109],"interesting":[110],"sets":[111],"PP.":[118],"results":[121],"used":[123],"obtain":[125],"positive":[126],"relativizations":[127],"classes.>":[130]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2125536734","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
