標(biāo)題: Titlebook: Complexity Theory of Real Functions; Ker-I Ko Book 1991 Birkh?user Boston 1991 Approximation.NP-completeness.Notation.algorithm.algorithms [打印本頁] 作者: minuscule 時(shí)間: 2025-3-21 17:59
書目名稱Complexity Theory of Real Functions影響因子(影響力)
書目名稱Complexity Theory of Real Functions影響因子(影響力)學(xué)科排名
書目名稱Complexity Theory of Real Functions網(wǎng)絡(luò)公開度
書目名稱Complexity Theory of Real Functions網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Complexity Theory of Real Functions被引頻次
書目名稱Complexity Theory of Real Functions被引頻次學(xué)科排名
書目名稱Complexity Theory of Real Functions年度引用
書目名稱Complexity Theory of Real Functions年度引用學(xué)科排名
書目名稱Complexity Theory of Real Functions讀者反饋
書目名稱Complexity Theory of Real Functions讀者反饋學(xué)科排名
作者: 膽小鬼 時(shí)間: 2025-3-22 00:09
has quickly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical作者: MURKY 時(shí)間: 2025-3-22 02:54
Advances in Neural Networks - ISNN 2017he derivative itself) then the derivative may be easy to compute. Formally, we prove that the derivative of a polynomial-time computable function is polynomial-time computable if and only if it has a polynomial modulus of continuity. Conversely, we can construct a function / in . such that its derivative exists everywhere but is not computable.作者: Jacket 時(shí)間: 2025-3-22 08:29 作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-22 09:57
Smart Innovation, Systems and Technologiesble real functions is then defined, and several characterizations of this class will be given. Other complexity classes of real numbers and real functions, such as . real functions and log-space computable real functions, will be defined in later chapters.作者: 人工制品 時(shí)間: 2025-3-22 14:37 作者: 人工制品 時(shí)間: 2025-3-22 19:33
Abdujelil Abdurahman,Cheng Hu,Haijun Jiangisfies the Lipschitz condition is necessary so that the minimum value .*(.) is computable. For more about the motivations and applications of this problem, see Papadimitriou and Tsitsiklis [1982, 1986].作者: conifer 時(shí)間: 2025-3-22 22:24
Basics in Discrete Complexity Theory, complexity theory. Many important issues in the theory are omitted and most theorems are given without proofs. The reader who wishes to learn more systematically about complexity theory is referred to Garey and Johnson [1979] and Balcázar, Diaz and Gabarró [1988, 1990].作者: Initial 時(shí)間: 2025-3-23 04:24
An Optimization Problem in Control Theory,isfies the Lipschitz condition is necessary so that the minimum value .*(.) is computable. For more about the motivations and applications of this problem, see Papadimitriou and Tsitsiklis [1982, 1986].作者: 的事物 時(shí)間: 2025-3-23 08:20
Book 1991ly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundatio作者: 小歌劇 時(shí)間: 2025-3-23 10:53
Progress in Theoretical Computer Sciencehttp://image.papertrans.cn/c/image/231657.jpg作者: 賠償 時(shí)間: 2025-3-23 17:00 作者: predict 時(shí)間: 2025-3-23 19:24
Sergey V. Stasenko,Victor B. Kazantsevn logarithmic space and exponential space. Some results on complexity classes of sparse sets and tally sets are included because they are closely related to the structure of the representations of real numbers under our formal definition. Other results in discrete complexity theory, not directly rel作者: Chronic 時(shí)間: 2025-3-24 01:26
Smart Innovation, Systems and Technologiesnumbers and computable real functions and their basic properties. Then, the oracle Turing machine is introduced as the formal model for computing real functions. This model allows us to define the complexity measures for computing real functions in a natural way. The class of polynomial time computa作者: 某人 時(shí)間: 2025-3-24 05:41
Model Complexity Control in Clusteringoptimization and nondeterminism have been observed, as many combinatorial optimization problems have been shown to be .-complete (cf. Garey and Johnson [1979]). On the other hand, optimization of a continuous function can often be solved in polynomial time. As an example, the linear programming prob作者: 斥責(zé) 時(shí)間: 2025-3-24 08:33 作者: Contend 時(shí)間: 2025-3-24 14:01
https://doi.org/10.1007/978-3-319-59072-1mputational viewpoint, we may define a recursively measurable set to be one that can be approximated by simple open sets such that the measures of the approximation errors converge to zero recursively. A polynomial-time measurable set, or, more appropriately, a polynomial-time approximable set then 作者: 衰弱的心 時(shí)間: 2025-3-24 18:38
Advances in Neural Networks - ISNN 2017rd to compute from the approximation of the function. However, if some nice properties about the function is known (such as the differentiability of the derivative itself) then the derivative may be easy to compute. Formally, we prove that the derivative of a polynomial-time computable function is p作者: 匯總 時(shí)間: 2025-3-24 22:02
https://doi.org/10.1007/978-3-319-12436-0by a polynomial-time computable function . on the rectangle [0,1] × [-1,1]. We consider only ordinary differential equations of the first order, and only equations with initial conditions. The complexity of the solutions . of equation (7.1) depends on certain properties of the function .. First, if 作者: Cougar 時(shí)間: 2025-3-24 23:52
Biao Luo,Derong Liu,Xiong Yang,Hongwen Mamial function . such that .(.(. 2. for all . ∈ [0, 1], In this chapter we investigate the polynomial-time version of the Weierstrass approximation theorem: Is the sequence |.} polynomial-time computable, if . is known to be polynomial-time computable? Pour-El and Caldwell [1975] proved that the recu作者: 吸氣 時(shí)間: 2025-3-25 04:55
Abdujelil Abdurahman,Cheng Hu,Haijun Jianges the Lipschitz condition, compute the minimum value . Intuitively, the function . may be viewed as the cost function on inputs ., . ∈ [0, 1] and the corresponding decisions .(.) and .(.) on these inputs. The decision functions . and . are based only on part of the input values and perform, in a se作者: judiciousness 時(shí)間: 2025-3-25 08:02 作者: Formidable 時(shí)間: 2025-3-25 11:43
978-1-4684-6804-5Birkh?user Boston 1991作者: 昏迷狀態(tài) 時(shí)間: 2025-3-25 19:47 作者: EVICT 時(shí)間: 2025-3-25 22:23 作者: CLAMP 時(shí)間: 2025-3-26 02:32
Introduction,emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundation f作者: Obliterate 時(shí)間: 2025-3-26 06:34 作者: 材料等 時(shí)間: 2025-3-26 12:20 作者: 未成熟 時(shí)間: 2025-3-26 14:44 作者: FLOUR 時(shí)間: 2025-3-26 20:18 作者: graphy 時(shí)間: 2025-3-26 21:35 作者: 單片眼鏡 時(shí)間: 2025-3-27 04:13
Differentiation,rd to compute from the approximation of the function. However, if some nice properties about the function is known (such as the differentiability of the derivative itself) then the derivative may be easy to compute. Formally, we prove that the derivative of a polynomial-time computable function is p作者: 鞭打 時(shí)間: 2025-3-27 08:38
Ordinary Differentiation Equations,by a polynomial-time computable function . on the rectangle [0,1] × [-1,1]. We consider only ordinary differential equations of the first order, and only equations with initial conditions. The complexity of the solutions . of equation (7.1) depends on certain properties of the function .. First, if 作者: DEMN 時(shí)間: 2025-3-27 11:43
Approximation by Polynomials,mial function . such that .(.(. 2. for all . ∈ [0, 1], In this chapter we investigate the polynomial-time version of the Weierstrass approximation theorem: Is the sequence |.} polynomial-time computable, if . is known to be polynomial-time computable? Pour-El and Caldwell [1975] proved that the recu作者: PANG 時(shí)間: 2025-3-27 17:17
An Optimization Problem in Control Theory,es the Lipschitz condition, compute the minimum value . Intuitively, the function . may be viewed as the cost function on inputs ., . ∈ [0, 1] and the corresponding decisions .(.) and .(.) on these inputs. The decision functions . and . are based only on part of the input values and perform, in a se作者: thalamus 時(shí)間: 2025-3-27 19:49 作者: Daily-Value 時(shí)間: 2025-3-27 23:54
Model Complexity Control in Clusteringtion . on [0,1]. It is to be shown that these maximum values axe exactly the real numbers which have a (general) left cut in . (called left . real numbers). For two-dimensional, polynomial-time computable functions . on [0, l]., the maximum functions .) = max{., .)| 0 ≤ . ≤ 1} coincide with . real f作者: Ligneous 時(shí)間: 2025-3-28 02:54
https://doi.org/10.1007/978-3-319-59072-1e restrict our attention to the class of continuous functions which have polynomial moduli of continuity, then it is not known whether the notion of polynomial-time approximability is strictly stronger than the notion of polynomial-time computability.作者: 歪曲道理 時(shí)間: 2025-3-28 06:54 作者: 無關(guān)緊要 時(shí)間: 2025-3-28 10:50
Biao Luo,Derong Liu,Xiong Yang,Hongwen Maeierstrass approximation theorem does hold and so a polynomial-time evaluable straight-line program for . can be found in polynomial time if . is itself polynomial-time computable. However, the strong form of the theorem that requires the output of the coefficients of . fails. Thus, the integrals of作者: Synovial-Fluid 時(shí)間: 2025-3-28 18:13
Introduction,orial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like to find a 作者: 使習(xí)慣于 時(shí)間: 2025-3-28 20:27
Maximization,tion . on [0,1]. It is to be shown that these maximum values axe exactly the real numbers which have a (general) left cut in . (called left . real numbers). For two-dimensional, polynomial-time computable functions . on [0, l]., the maximum functions .) = max{., .)| 0 ≤ . ≤ 1} coincide with . real f作者: TATE 時(shí)間: 2025-3-29 00:29 作者: 圖畫文字 時(shí)間: 2025-3-29 06:16
Ordinary Differentiation Equations,on the solution . (for example, by the use of the Euler method). The main result of this chapter proves that polynomial space is also a lower bound for the solution . of equation (7.1) if the function . is polynomial-time computable and satisfies a weak form of local Lipschitz condition in the neigh作者: 背心 時(shí)間: 2025-3-29 09:24 作者: irreparable 時(shí)間: 2025-3-29 14:27
Book 1991ng combinatorial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like
