找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Complexity Theory Retrospective; In Honor of Juris Ha Alan L. Selman Book 1990 Springer-Verlag New York Inc. 1990 Counting.algorithm.algori

[复制链接]
查看: 35023|回复: 43
发表于 2025-3-21 19:41:34 | 显示全部楼层 |阅读模式
书目名称Complexity Theory Retrospective
副标题In Honor of Juris Ha
编辑Alan L. Selman
视频video
图书封面Titlebook: Complexity Theory Retrospective; In Honor of Juris Ha Alan L. Selman Book 1990 Springer-Verlag New York Inc. 1990 Counting.algorithm.algori
描述In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis‘ contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.
出版日期Book 1990
关键词Counting; algorithm; algorithms; complexity; complexity theory; theory of computation; algorithm analysis
版次1
doihttps://doi.org/10.1007/978-1-4612-4478-3
isbn_softcover978-1-4612-8793-3
isbn_ebook978-1-4612-4478-3
copyrightSpringer-Verlag New York Inc. 1990
The information of publication is updating

书目名称Complexity Theory Retrospective影响因子(影响力)




书目名称Complexity Theory Retrospective影响因子(影响力)学科排名




书目名称Complexity Theory Retrospective网络公开度




书目名称Complexity Theory Retrospective网络公开度学科排名




书目名称Complexity Theory Retrospective被引频次




书目名称Complexity Theory Retrospective被引频次学科排名




书目名称Complexity Theory Retrospective年度引用




书目名称Complexity Theory Retrospective年度引用学科排名




书目名称Complexity Theory Retrospective读者反馈




书目名称Complexity Theory Retrospective读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:11:57 | 显示全部楼层
发表于 2025-3-22 02:08:52 | 显示全部楼层
,Juris Hartmanis: Building a Department—Building a Discipline, title which I think better suggests the profound impact Juris Hartmanis has had on our discipline. Beyond his seminal and ongoing contributions to the field of complexity, Hartmanis was able to use his research reputation not only to develop a department but, moreover, to strongly influence the dir
发表于 2025-3-22 06:49:27 | 显示全部楼层
发表于 2025-3-22 12:46:52 | 显示全部楼层
发表于 2025-3-22 14:45:40 | 显示全部楼层
发表于 2025-3-22 20:38:48 | 显示全部楼层
Just Wars: Doctrines and Institutions, for restricted programming systems, including the . that all polynomial time programming systems are polynomially isomorphic. Second, the research on isomorphisms, and particularly polynomial time isomorphisms for complete problems for various natural complexity classes, including the . that all se
发表于 2025-3-23 01:03:29 | 显示全部楼层
The Growth of International Institutions, unordered graphs?” We consider the languages .. consisting of first-order logic restricted to . variables and .. consisting of .. plus “counting quantifiers”. We give efficient canonization algorithms for graphs characterized by .. or ... It follows from known results that all trees and almost all
发表于 2025-3-23 04:44:22 | 显示全部楼层
发表于 2025-3-23 07:08:52 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 07:05
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表