{"id":"https://openalex.org/W2184746130","doi":null,"title":"Lecture Notes on Computational Complexity","display_name":"Lecture Notes on Computational Complexity","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2184746130","mag":"2184746130"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.2276","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~luca/cs278/../notes/complexitynotes02.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"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/A5057752375","display_name":"Luca Trevisan","orcid":"https://orcid.org/0000-0002-6982-8530","observed_orcids":["https://orcid.org/0000-0002-6982-8530"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luca Trevisan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5057752375"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5585,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.80770257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"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.9965999722480774,"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.9965999722480774,"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.0020000000949949026,"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.0006000000284984708,"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/computational-complexity","display_name":"computational complexity","score":0.9100000262260437},{"id":"https://openalex.org/keywords/bounded-depth-circuits","display_name":"bounded-depth circuits","score":0.8460000157356262},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"proof complexity","score":0.8069999814033508},{"id":"https://openalex.org/keywords/pseudorandom-generators","display_name":"pseudorandom generators","score":0.9570000171661377},{"id":"https://openalex.org/keywords/extractors","display_name":"extractors","score":0.9679999947547913},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.5509999990463257}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5159805417060852},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47040849924087524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19540148973464966}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.2276","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~luca/cs278/../notes/complexitynotes02.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.9877","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.9877","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~luca/notes/complexitynotes02.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.2831","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.2831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~luca/notes/complexitynotes02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":79,"referenced_works":["https://openalex.org/W82974974","https://openalex.org/W258677105","https://openalex.org/W1481582196","https://openalex.org/W1501644705","https://openalex.org/W1563159456","https://openalex.org/W1564025554","https://openalex.org/W1572772224","https://openalex.org/W1590283810","https://openalex.org/W1594093559","https://openalex.org/W1594962164","https://openalex.org/W1596720500","https://openalex.org/W1599026900","https://openalex.org/W1871606885","https://openalex.org/W1901622511","https://openalex.org/W1967175855","https://openalex.org/W1970089350","https://openalex.org/W1970259241","https://openalex.org/W1970606468","https://openalex.org/W1974170280","https://openalex.org/W1975442866","https://openalex.org/W1980879781","https://openalex.org/W1982129592","https://openalex.org/W1984976620","https://openalex.org/W1996184580","https://openalex.org/W1998918799","https://openalex.org/W2006912660","https://openalex.org/W2011112377","https://openalex.org/W2014064621","https://openalex.org/W2015880590","https://openalex.org/W2019578639","https://openalex.org/W2025819235","https://openalex.org/W2036095420","https://openalex.org/W2036265926","https://openalex.org/W2043360684","https://openalex.org/W2045924252","https://openalex.org/W2057512592","https://openalex.org/W2059442002","https://openalex.org/W2060270693","https://openalex.org/W2065251436","https://openalex.org/W2069767473","https://openalex.org/W2069919161","https://openalex.org/W2070437169","https://openalex.org/W2070678975","https://openalex.org/W2074876220","https://openalex.org/W2080132708","https://openalex.org/W2081254453","https://openalex.org/W2082647621","https://openalex.org/W2083027849","https://openalex.org/W2084384424","https://openalex.org/W2086653003","https://openalex.org/W2089272132","https://openalex.org/W2094878497","https://openalex.org/W2096390054","https://openalex.org/W2098324348","https://openalex.org/W2100008268","https://openalex.org/W2107324709","https://openalex.org/W2111385661","https://openalex.org/W2111978056","https://openalex.org/W2118547397","https://openalex.org/W2119913278","https://openalex.org/W2125495920","https://openalex.org/W2133527541","https://openalex.org/W2133844229","https://openalex.org/W2137373403","https://openalex.org/W2140441560","https://openalex.org/W2143391442","https://openalex.org/W2143399830","https://openalex.org/W2148352980","https://openalex.org/W2148957455","https://openalex.org/W2153417364","https://openalex.org/W2160403361","https://openalex.org/W2165293955","https://openalex.org/W2173249896","https://openalex.org/W2202947145","https://openalex.org/W2293988196","https://openalex.org/W2611398525","https://openalex.org/W2998808137","https://openalex.org/W3004537778","https://openalex.org/W3111890340"],"related_works":["https://openalex.org/W2411683492","https://openalex.org/W1512164049","https://openalex.org/W597847616","https://openalex.org/W7096463643","https://openalex.org/W45107152","https://openalex.org/W7101035401","https://openalex.org/W1551508324","https://openalex.org/W7098945138","https://openalex.org/W129922982","https://openalex.org/W7099423726"],"abstract_inverted_index":{"These":[0],"are":[1,78],"scribed":[2,27,37],"notes":[3,26,36,43,102,143],"from":[4],"a":[5],"graduate":[6],"courses":[7],"on":[8,25,34,80,144],"Computational":[9],"Complexity":[10],"offered":[11],"at":[12,17],"the":[13,20,70,132,142],"University":[14],"of":[15,22],"California":[16],"Berkeley":[18],"in":[19,30,38,46,89,94],"Fall":[21,39,74],"2002,":[23],"based":[24],"by":[28],"students":[29],"Spring":[31],"2001":[32],"and":[33,44,96,99,108,114,124,152],"additional":[35],"2002.":[40],"I":[41,68,116],"added":[42],"references":[45],"May":[47],"2004.":[48],"The":[49,56,101,129],"first":[50],"15":[51],"lectures":[52,58,79],"cover":[53,59],"fundamental":[54],"material.":[55],"remaining":[57],"more":[60],"advanced":[61],"material,":[62],"that":[63],"is":[64],"different":[65],"each":[66],"time":[67],"teach":[69],"class.":[71],"In":[72],"these":[73,127],"2002":[75],"notes,":[76],"there":[77,109],"H\u02daastad\u2019s":[81],"optimal":[82],"inapproximability":[83],"results,":[84],"lower":[85,92],"bounds":[86,93],"for":[87,131],"parity":[88],"bounded":[90],"depth-circuits,":[91],"proof-complexity,":[95],"pseudorandom":[97],"generators":[98],"extractors.":[100],"have":[103],"been":[104],"only":[105],"minimally":[106],"edited,":[107],"may":[110],"be":[111,118],"several":[112],"errors":[113],"imprecisions.":[115],"will":[117],"happy":[119],"to":[120],"receive":[121],"comments,":[122],"criticism":[123],"corrections":[125],"about":[126],"notes.":[128],"syllabus":[130],"course":[133],"was":[134],"developed":[135],"jointly":[136],"with":[137],"Sanjeev":[138,140],"Arora.":[139],"wrote":[141],"Yao\u2019s":[145],"XOR":[146],"Lemma":[147],"(Lecture":[148],"11).":[149],"Many":[150],"people,":[151],"especially":[153],"Avi":[154],"Wigderson,":[155]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2025-10-27T00:00:00"}