找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Structure in Complexity Theory; Proceedings of the C Alan L. Selman Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Arit

[复制链接]
楼主: miserly
发表于 2025-3-30 10:14:58 | 显示全部楼层
An optimal lower bound for turing machines with one work tape and a two-way input tape, often called "offline 1-tape Turing machines"). In particular we prove an optimal lower bound of Ω(n./(log n).) for transposing a matrix with elements of bit length ∘(logn) (where n is the length of the total input). This implies a lower bound of Ω(n./(log n).) for sorting on the considered type of
发表于 2025-3-30 14:15:25 | 显示全部楼层
发表于 2025-3-30 20:06:13 | 显示全部楼层
The polynomial hierarchy and intuitionistic Bounded Arithmetic,definable functions..The method of proof uses □.-realizability which is inspired by the recursive realizability of S.C. Kleene [3] and D. Nelson [5]. It also involves polynomial hierarchy functionals of finite type which are introduced in this paper.
发表于 2025-3-30 23:24:47 | 显示全部楼层
The boolean hierarchy: Hardware over NP,classes. Some results present new ideas and techniques. Others put previous results about NP and D. in a richer perspective. Throughout, we emphasize the structure of the boolean hierarchy and its relations with more common classes.
发表于 2025-3-31 02:44:53 | 显示全部楼层
发表于 2025-3-31 06:49:49 | 显示全部楼层
An optimal lower bound for turing machines with one work tape and a two-way input tape, Turing machine. We also get as corollaries the first nonlinear lower bound for the most difficult version of the two tapes — versus — one problem, and a separation of the considered type of Turing machine from that with an additional write-only output tape.
发表于 2025-3-31 10:13:47 | 显示全部楼层
Probabilistic game automata,eterministically constructible and .(.)=Ω(.). The equality.(.(.))=.(.(.)) is due to Papadimitriou[9]. All the other inclusions above except one involve the simulation of one game by another. The exception is the result that .(.(.))⊑.(.(.)) which is shown byreducing a certain game theoretic problem to linear programming.
发表于 2025-3-31 14:49:04 | 显示全部楼层
Resource-bounded Kolmogorov complexity of hard languages, descriptional complexity of Boolean circuits and formulas for hard languages. This result provides a classification of exponential-size circuits and formulas in terms of the amount of information contained in them.
发表于 2025-3-31 21:18:19 | 显示全部楼层
1431-1917 implications of his philosophy for the social, economic, educational, and political structuring of the health care system.978-1-4612-7815-3978-1-4612-3150-9Series ISSN 1431-1917 Series E-ISSN 2197-3741
发表于 2025-3-31 23:06:02 | 显示全部楼层
Dominik Rupprecht,Rainer Blum,Karim Khakzarnsition from goal-oriented, incentive processes to automatic, habit-based responding. In the cortex, weak inhibitory control is a predisposing factor to, as well as a consequence of, repeated drug intake. However, these transitions are not absolute, and addiction can occur without a transition to ha
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-5 21:27
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表