Computational Complexity Theory最新文献

筛选
英文 中文
Complexity theory: From Gödel to Feynman 复杂性理论:从Gödel到费曼
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/02
S. Rudich
{"title":"Complexity theory: From Gödel to Feynman","authors":"S. Rudich","doi":"10.1090/pcms/010/02","DOIUrl":"https://doi.org/10.1090/pcms/010/02","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114454163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Average case complexity 平均案例复杂度
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/03
A. Wigderson
{"title":"Average case complexity","authors":"A. Wigderson","doi":"10.1090/pcms/010/03","DOIUrl":"https://doi.org/10.1090/pcms/010/03","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114468132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Probabilistic proof systems - Part I 概率证明系统。第1部分
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/11
S. Vadhan
{"title":"Probabilistic proof systems - Part I","authors":"S. Vadhan","doi":"10.1090/pcms/010/11","DOIUrl":"https://doi.org/10.1090/pcms/010/11","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121815124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Preface to "Week Three: Randomness in Computation" “第三周:计算中的随机性”前言
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/08
Oded Goldreich
{"title":"Preface to \"Week Three: Randomness in Computation\"","authors":"Oded Goldreich","doi":"10.1090/pcms/010/08","DOIUrl":"https://doi.org/10.1090/pcms/010/08","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126539068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Quantum computation 量子计算
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/05
R. Raz
{"title":"Quantum computation","authors":"R. Raz","doi":"10.1090/pcms/010/05","DOIUrl":"https://doi.org/10.1090/pcms/010/05","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pseudorandomness - Part II
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/10
L. Trevisan
{"title":"Pseudorandomness - Part II","authors":"L. Trevisan","doi":"10.1090/pcms/010/10","DOIUrl":"https://doi.org/10.1090/pcms/010/10","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Proof complexity 证明的复杂性
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/07
P. Beame
{"title":"Proof complexity","authors":"P. Beame","doi":"10.1090/pcms/010/07","DOIUrl":"https://doi.org/10.1090/pcms/010/07","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133384495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Pseudorandomness - Part I 伪随机性——第一部分
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/09
Oded Goldreich
{"title":"Pseudorandomness - Part I","authors":"Oded Goldreich","doi":"10.1090/pcms/010/09","DOIUrl":"https://doi.org/10.1090/pcms/010/09","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117218205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Circuit and Communication Complexity 电路与通信复杂性
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/06
R. Raz
{"title":"Circuit and Communication Complexity","authors":"R. Raz","doi":"10.1090/pcms/010/06","DOIUrl":"https://doi.org/10.1090/pcms/010/06","url":null,"abstract":"There is an interesting connection between communication complexity and the depth of Boolean circuits. In the next lectures, we will explore this connection and we will use it to prove lower bounds for the depth of monotone Boolean circuits. In particular, we will prove a lower bound of Ω(log n) for the monotone depth of directed st-Connectivity and a lower bound of Ω(n) for the monotone depth of Matching.","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123084954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exploring complexity through reductions 通过简化探索复杂性
Computational Complexity Theory Pub Date : 1900-01-01 DOI: 10.1090/pcms/010/04
Sanjeev Arora
{"title":"Exploring complexity through reductions","authors":"Sanjeev Arora","doi":"10.1090/pcms/010/04","DOIUrl":"https://doi.org/10.1090/pcms/010/04","url":null,"abstract":"","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128569918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书