发布求助
文献互助 智能选刊 最新文献

Complexity of Computer Computations最新文献

筛选
英文 中文
Efficiency of Equivalence Algorithms 等效算法的效率
Complexity of Computer Computations Pub Date : 1972-04-01 DOI: 10.1007/978-1-4684-2001-2_14
M. Fischer
{"title":"Efficiency of Equivalence Algorithms","authors":"M. Fischer","doi":"10.1007/978-1-4684-2001-2_14","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_14","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121994960","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}
引用次数: 43
Evaluation of Rational Functions 有理函数的求值
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_1
V. Strassen
{"title":"Evaluation of Rational Functions","authors":"V. Strassen","doi":"10.1007/978-1-4684-2001-2_1","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_1","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"14 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":"130223582","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}
引用次数: 49
Parallel Iteration Methods 并行迭代方法
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_6
S. Winograd
{"title":"Parallel Iteration Methods","authors":"S. Winograd","doi":"10.1007/978-1-4684-2001-2_6","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_6","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","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":"130428683","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}
引用次数: 7
Efficient Iterations for Algebraic Numbers 代数数的有效迭代
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_5
M. Paterson
{"title":"Efficient Iterations for Algebraic Numbers","authors":"M. Paterson","doi":"10.1007/978-1-4684-2001-2_5","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_5","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"20 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":"123369220","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}
引用次数: 12
Toward a Lower Bound for Sorting Networks 论排序网络的下界
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_12
D. Voorhis
{"title":"Toward a Lower Bound for Sorting Networks","authors":"D. Voorhis","doi":"10.1007/978-1-4684-2001-2_12","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_12","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"41 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":"114867625","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}
引用次数: 17
Permuting Information in Idealized Two-Level Storage 理想两级存储中的信息排列
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_10
R. W. Floyd
{"title":"Permuting Information in Idealized Two-Level Storage","authors":"R. W. Floyd","doi":"10.1007/978-1-4684-2001-2_10","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_10","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"75 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":"123886540","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}
引用次数: 106
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication 关于矩阵乘法复杂度上界的求取
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_4
C. M. Fiduccia
{"title":"On Obtaining Upper Bounds on the Complexity of Matrix Multiplication","authors":"C. M. Fiduccia","doi":"10.1007/978-1-4684-2001-2_4","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_4","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"405 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":"114437023","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}
引用次数: 50
Simple Proofs of Lower Bounds for Polynomial Evaluation 多项式求值下界的简单证明
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_3
E. Reingold, A. I. Stocks
{"title":"Simple Proofs of Lower Bounds for Polynomial Evaluation","authors":"E. Reingold, A. I. Stocks","doi":"10.1007/978-1-4684-2001-2_3","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_3","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"41 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":"133993167","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}
引用次数: 5
An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File 顺序访问文件中n条记录最优分布的n log n算法
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_11
V. Pratt
{"title":"An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File","authors":"V. Pratt","doi":"10.1007/978-1-4684-2001-2_11","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_11","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"23 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":"128279962","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}
引用次数: 20
The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations 非线性方程组迭代法的计算复杂度
Complexity of Computer Computations Pub Date : 1900-01-01 DOI: 10.1007/978-1-4684-2001-2_7
R. Brent
{"title":"The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations","authors":"R. Brent","doi":"10.1007/978-1-4684-2001-2_7","DOIUrl":"https://doi.org/10.1007/978-1-4684-2001-2_7","url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"125 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":"131526354","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}
引用次数: 10
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信