8.5 NL-Completeness Log space reducibility may get the appearance of somewhat restrictive, but in fact it is adequate for most reductions in complexity theory. For example, theorem 8.9 said every PSPACE problem is polynomial time reducible to TQBF. However, these reductions may be computed using o...
Structure in Complexity Theory ConferenceE. Allender and O. Watanabe. Kolmogorov Complexity and degrees of Tally sets. Information and Computation 86(2), ... E Allender,O Watanabe - Structure in Complexity Theory Conference 被引量: 54发表: 1990年 Aspects of Complexity of computation, probability ...
Summary: Complexity theory is the area of the theory of computation that deals with the study and classification of the amount of computational resources required to solve problems. The subject is intellectually exciting and central to the field of computer science as well as to understanding how ...
Computational complexity theory Computational Component Computational Crystallography Initiative Computational Decision Making Computational Device Computational Diagnostics, Inc. Computational Diffie Hellman Computational Diffie Hellman Problem Computational Dynamic Fracture Mechanics ...
The theory of computational complexity addresses this issue. Complexity theory is a comparatively young field, with seminal papers dating from 1971–1972 ([ 1 ], [ 5 ]). Today, it is a wide field encompassing many subfields. For a formal treatment, see [ 6 ]. As we shall see, the ...
o 4.1 Significance of Complexity • Bibliography • Academic Tools • Other Internet Resources • Related Entries What can be computed in principle? Introduction and History 在1930年代,也就是远在计算机被发明出来之前,世界各地的数学家发现了关于,“什么是可计算的”这个东西的,精确与独立的定义。丘...
It begins with the basics of classical theory of computation: Turing ... AY Kitaev,AH Shen,MN Vyalyi - 《American Mathematical Monthly》 被引量: 639发表: 2011年 COMBINATORIAL HOPF ALGEBRAS IN QUANTUM FIELD THEORY I The rest of part I, comprising Sections 2-6, is devoted to the basics ...
Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts wi...
computational complexity theory 计算机科学中研究数学问题的内在难度的理论。一个问题的难度反映在求解该问题所花费的计算资源的多少之上 ,常用的计算资源有:计算所需的时间,计算所需的存储空间等。对计算复杂性的研究能够使人们弄清被求解问题的固有难度,评价某个算法的优劣,或者获取更高效的算法。 为了研究计算复杂性...
We present a model for computation over the reals or an arbitrary (ordered) ringR. In this general setting, we obtain universal machines, partial recursive functions, as well asNP-complete problems. While our theory reflects the classical overZ(e.g., the computable functions are the recursive...