{"id":"https://openalex.org/W107779203","doi":null,"title":"Efficiently Approximable Real-Valued Functions","display_name":"Efficiently Approximable Real-Valued Functions","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W107779203","mag":"107779203"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.6979","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.6979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~kabanets/papers/focs00-app.ps.gz","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5066747130","display_name":"Valentine Kabanets","orcid":"https://orcid.org/0009-0002-2861-017X","observed_orcids":["https://orcid.org/0009-0002-2861-017X"]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Valentine Kabanets","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071766529","display_name":"Charles Rackoff","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Charles Rackoff","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034555443","display_name":"Stephen A Cook","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen Cook","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":2.6912,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88450267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9639000296592712,"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.9639000296592712,"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.02290000021457672,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.003000000026077032,"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/real-functions","display_name":"real functions","score":0.703000009059906},{"id":"https://openalex.org/keywords/probabilistic-turing-machines","display_name":"probabilistic Turing machines","score":0.6610000133514404},{"id":"https://openalex.org/keywords/bpp","display_name":"BPP","score":0.8730000257492065},{"id":"https://openalex.org/keywords/derandomization","display_name":"derandomization","score":0.6919999718666077},{"id":"https://openalex.org/keywords/complete-problems","display_name":"complete problems","score":0.652999997138977},{"id":"https://openalex.org/keywords/oracle-construction","display_name":"oracle construction","score":0.6539999842643738},{"id":"https://openalex.org/keywords/complexity-classes","display_name":"complexity classes","score":0.5600000023841858}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7819324135780334},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6410706639289856},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5955557227134705},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5718338489532471},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5589089393615723},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5051527619361877},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5031663775444031},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48080888390541077},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4767257273197174},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4720281660556793},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.45680755376815796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4561421871185303},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4533138573169708},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4343818724155426},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.4331088066101074},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4042203426361084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3480682075023651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24590784311294556},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1347225308418274},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.055665791034698486},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.6979","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.6979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~kabanets/papers/focs00-app.ps.gz","raw_type":"text"},{"id":"mag:107779203","doi":null,"is_oa":false,"landing_page_url":"http://www.cs.sfu.ca/~kabanets/papers/app-00.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W156977962","https://openalex.org/W1545819195","https://openalex.org/W1569394207","https://openalex.org/W1591518631","https://openalex.org/W1594093559","https://openalex.org/W1972416792","https://openalex.org/W1973576061","https://openalex.org/W1988127406","https://openalex.org/W1993138363","https://openalex.org/W2006786362","https://openalex.org/W2021736779","https://openalex.org/W2025819235","https://openalex.org/W2078999165","https://openalex.org/W2084732248","https://openalex.org/W2100570449","https://openalex.org/W2111978056","https://openalex.org/W2121602661","https://openalex.org/W2131798840","https://openalex.org/W2140441560","https://openalex.org/W2143399830","https://openalex.org/W2295428206"],"related_works":["https://openalex.org/W7031858320","https://openalex.org/W7098323769","https://openalex.org/W7096888382","https://openalex.org/W2370465935","https://openalex.org/W7079882","https://openalex.org/W2166214836","https://openalex.org/W2113352087","https://openalex.org/W7096178671","https://openalex.org/W2004419188","https://openalex.org/W7101041293"],"abstract_inverted_index":{"We":[0,39,78],"consider":[1],"a":[2,30,47,56,65,129,159],"class,":[3],"denoted":[4],"APP,":[5],"of":[6,49,64,131,141,153],"real-valued":[7],"functions":[8],"f":[9,19],":":[10],"f0;":[11],"1g":[12],"n":[13],"!":[14],"[0;":[15],"1]":[16],"such":[17],"that":[18,41,53,80,96,106,133],"can":[20,43,91,134],"be":[21,44,92,109,135],"approximated,":[22],"to":[23],"within":[24],"any":[25],"ffl":[26],"?":[27],"0,":[28],"by":[29,115],"probabilistic":[31],"Turing":[32],"machine":[33,161],"running":[34],"in":[35,69],"time":[36],"poly(n;":[37],"1=ffl).":[38],"argue":[40],"APP":[42,54,97,112],"viewed":[45],"as":[46],"generalization":[48],"BPP,":[50],"and":[51],"show":[52,105],"contains":[55],"natural":[57,148],"complete":[58,72],"problem:":[59],"computing":[60],"the":[61,101,139,150],"acceptance":[62],"probability":[63],"given":[66],"Boolean":[67],"circuit;":[68],"contrast,":[70],"no":[71],"problems":[73],"are":[74],"known":[75,82],"for":[76],"BPP.":[77],"observe":[79],"all":[81],"complexity-theoretic":[83],"assumptions":[84],"under":[85],"which":[86],"BPP":[87,107,125,160],"is":[88,98,113,126],"easy":[89,110],"(i.e.,":[90],"efficiently":[93,136],"derandomized)":[94],"imply":[95],"easy;":[99],"on":[100],"other":[102],"hand,":[103],"we":[104],"may":[108],"while":[111],"not,":[114],"constructing":[116],"an":[117],"appropriate":[118],"oracle.":[119],"1":[120],"Introduction":[121],"The":[122],"complexity":[123],"class":[124,130],"traditionally":[127],"considered":[128],"languages":[132],"decided":[137],"with":[138],"help":[140],"randomness.":[142],"While":[143],"it":[144],"does":[145],"contain":[146],"some":[147],"problems,":[149],"\"semantic\"":[151],"nature":[152],"its":[154],"definition":[155],"(on":[156],"every":[157],"input,":[158],"must":[162],"have":[163],"either":[164],"at":[165],"least":[166],"3=4":[167],"or":[168],"at...":[169]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}