{"id":"https://openalex.org/W2084342799","doi":"https://doi.org/10.1142/s0129054100000326","title":"UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS","display_name":"UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS","publication_year":2000,"publication_date":"2000-12-01","ids":{"openalex":"https://openalex.org/W2084342799","doi":"https://doi.org/10.1142/s0129054100000326","mag":"2084342799"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054100000326","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054100000326","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5049639443","display_name":"Sven Kosub","orcid":"https://orcid.org/0000-0001-6316-8546"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"SVEN KOSUB","raw_affiliation_strings":["Theoretische Informatik, Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Am Hubland, D-97074 W\u00fcrzburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Am Hubland, D-97074 W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020319042","display_name":"Heinz Schmitz","orcid":"https://orcid.org/0000-0002-3371-6983"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"HEINZ SCHMITZ","raw_affiliation_strings":["Theoretische Informatik, Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Am Hubland, D-97074 W\u00fcrzburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Am Hubland, D-97074 W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008982209","display_name":"Heribert Vollmer","orcid":"https://orcid.org/0000-0002-9292-1960"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"HERIBERT VOLLMER","raw_affiliation_strings":["Theoretische Informatik, Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Am Hubland, D-97074 W\u00fcrzburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Am Hubland, D-97074 W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I25974101"],"apc_list":null,"apc_paid":null,"fwci":0.9309,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77041959,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"04","first_page":"525","last_page":"551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8037416934967041},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7088207602500916},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6579867005348206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6126940250396729},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5755283832550049},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5598618984222412},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5571815967559814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.556765079498291},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5495081543922424},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48387229442596436},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.45074209570884705},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4359036386013031},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3872763514518738},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29579102993011475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21312135457992554}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8037416934967041},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7088207602500916},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6579867005348206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6126940250396729},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5755283832550049},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5598618984222412},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5571815967559814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.556765079498291},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5495081543922424},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48387229442596436},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.45074209570884705},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4359036386013031},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3872763514518738},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29579102993011475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21312135457992554},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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":2,"locations":[{"id":"doi:10.1142/s0129054100000326","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054100000326","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.9989","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.9989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www14.in.tum.de/personen/kosub/publication/ko-sc-vo97.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320307758","display_name":"Eli Lilly and Company","ror":"https://ror.org/01qat3289"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1484001631","https://openalex.org/W1485836178","https://openalex.org/W1519432586","https://openalex.org/W1535979671","https://openalex.org/W1571190738","https://openalex.org/W1575897077","https://openalex.org/W1585412547","https://openalex.org/W1816633894","https://openalex.org/W1975790950","https://openalex.org/W1991034379","https://openalex.org/W1992972561","https://openalex.org/W1997129529","https://openalex.org/W2004815025","https://openalex.org/W2005079695","https://openalex.org/W2006912660","https://openalex.org/W2008999657","https://openalex.org/W2012182522","https://openalex.org/W2016550752","https://openalex.org/W2017143494","https://openalex.org/W2022212237","https://openalex.org/W2049316103","https://openalex.org/W2052053866","https://openalex.org/W2052582609","https://openalex.org/W2061489447","https://openalex.org/W2072181151","https://openalex.org/W2072808963","https://openalex.org/W2080456897","https://openalex.org/W2083553352","https://openalex.org/W2115826669","https://openalex.org/W2135990333","https://openalex.org/W2137407595","https://openalex.org/W2385027280"],"related_works":["https://openalex.org/W2125536734","https://openalex.org/W2000805093","https://openalex.org/W2144557478","https://openalex.org/W2041317738","https://openalex.org/W1982406523","https://openalex.org/W1483438220","https://openalex.org/W1676587966","https://openalex.org/W1638461282","https://openalex.org/W1629505938","https://openalex.org/W1495098865"],"abstract_inverted_index":{"We":[0,91],"introduce":[1],"a":[2,81,93,103,127],"general":[3],"framework":[4],"for":[5,108],"the":[6,155],"definition":[7],"of":[8,24,88],"function":[9,112],"classes.":[10,113],"Our":[11],"model,":[12],"which":[13,100],"is":[14,75,120,132],"based":[15],"on":[16],"nondeterministic":[17,89],"polynomial-time":[18],"Turing":[19],"transducers,":[20],"allows":[21],"uniform":[22],"characterizations":[23],"FP,":[25],"FP":[26,29],"NP":[27,30,45,143],",":[28,60],"[O":[31],"(":[32],"log":[33],"n)],":[34],"[Formula:":[35],"see":[36],"text],":[37],"counting":[38],"classes":[39,48,54,66],"(#\u00b7P,":[40],"#\u00b7NP,":[41],"#\u00b7coNP,":[42],"GapP,":[43],"GapP":[44],"),":[46,64],"optimization":[47],"(max\u00b7P,":[49],"min\u00b7P,":[50],"max\u00b7NP,":[51],"min\u00b7NP),":[52],"promise":[53],"(NPSV,":[55],"#":[56],"few":[57],"\u00b7":[58,139],"P":[59,63,140],"c":[61],"#\u00b7":[62],"multivalued":[65],"(FewFP,":[67],"NPMV),":[68],"and":[69,105,123],"many":[70],"more.":[71],"Each":[72],"such":[73,97,136],"class":[74],"defined":[76],"in":[77],"our":[78],"model":[79],"by":[80],"scheme":[82],"how":[83],"to":[84,102,152],"evaluate":[85],"computation":[86],"trees":[87],"machines.":[90],"study":[92],"reducibility":[94],"notion":[95],"between":[96,111],"evaluation":[98],"schemes,":[99],"leads":[101],"necessary":[104],"sufficient":[106],"criterion":[107,119],"relativizable":[109],"inclusion":[110],"As":[114],"it":[115],"turns":[116],"out,":[117],"this":[118],"easily":[121],"applicable":[122],"we":[124],"get":[125],"as":[126],"consequence,":[128],"e.g.,":[129],"that":[130,137,146],"there":[131],"an":[133],"oracle":[134],"A,":[135],"min":[138],"A":[141,144],"\u2288#\u00b7":[142],"(note":[145],"no":[147],"structural":[148],"consequences":[149],"are":[150],"known":[151],"follow":[153],"from":[154],"corresponding":[156],"positive":[157],"inclusion).":[158]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}