標(biāo)題: Titlebook: Computation Theory and Logic; Egon B?rger Book 1987 Springer-Verlag Berlin Heidelberg 1987 Algorithms.Automat.Boolean function.Variable.al [打印本頁(yè)] 作者: 要求 時(shí)間: 2025-3-21 18:46
書(shū)目名稱(chēng)Computation Theory and Logic影響因子(影響力)
書(shū)目名稱(chēng)Computation Theory and Logic影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Computation Theory and Logic網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Computation Theory and Logic網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Computation Theory and Logic被引頻次
書(shū)目名稱(chēng)Computation Theory and Logic被引頻次學(xué)科排名
書(shū)目名稱(chēng)Computation Theory and Logic年度引用
書(shū)目名稱(chēng)Computation Theory and Logic年度引用學(xué)科排名
書(shū)目名稱(chēng)Computation Theory and Logic讀者反饋
書(shū)目名稱(chēng)Computation Theory and Logic讀者反饋學(xué)科排名
作者: 靈敏 時(shí)間: 2025-3-21 23:03 作者: glisten 時(shí)間: 2025-3-22 03:44
Computation Theory and Logic978-3-540-47795-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 啤酒 時(shí)間: 2025-3-22 06:18
A. J. J. M. Vingerh?ets,L. J. Mengesomial time but every set which reduces to both A and B is polynomial time computable. We show that for every recursive set A?P there is a recursive set B such that A and B form a minimal pair. Moreover, similar results for pairs without greatest predecessors are proved.作者: Repatriate 時(shí)間: 2025-3-22 12:29 作者: Plaque 時(shí)間: 2025-3-22 13:24
A. J. J. M. Vingerh?ets,L. J. Mengesomial time but every set which reduces to both A and B is polynomial time computable. We show that for every recursive set A?P there is a recursive set B such that A and B form a minimal pair. Moreover, similar results for pairs without greatest predecessors are proved.作者: Plaque 時(shí)間: 2025-3-22 20:37
A. M. D. Porter,J. G. R. Howie,J. F. Forbesxistential fixed-point formula ., then . has a finite subset . such that every structure . with . = . satisfies .. (2) Using existential fixed-point logic instead of first-order logic removes the expressivity hypothesis in Cook‘s completeness theorem for Hoare logic. (3) In the presence of a success作者: RAGE 時(shí)間: 2025-3-22 21:54
A. J. J. M. Vingerh?ets,L. J. Mengesbe recursively unsolvable. A particularly interesting application of this method gives an affirmative answer to Flannagan‘s [1985] conjecture that the floundering property for queries with respect to MU-PROLOG programs is undecidable.作者: 險(xiǎn)代理人 時(shí)間: 2025-3-23 03:16 作者: 矛盾心理 時(shí)間: 2025-3-23 06:15
Otto H. Muller,David D. Pollardem. For probabilistic complexity classes with deterministically constructible bounds the standard diagonalization techniques can be applied and yield at least as dense hierarchies as in the deterministic case. For Monte Carlo (i.e. bounded error probability) classes the situation is quite different.作者: COM 時(shí)間: 2025-3-23 11:48
https://doi.org/10.1057/9781137292353ons are independent of the given form of the formula, i.e. operations applied to equivalent formulas result equivalent formulas. In order to estimate the required space and time we prove complexity bounds for each of the introduced operations. Finally our considerations are applied to so called inte作者: 勉勵(lì) 時(shí)間: 2025-3-23 17:09
Minimal pairs for polynomial time reducibilities,omial time but every set which reduces to both A and B is polynomial time computable. We show that for every recursive set A?P there is a recursive set B such that A and B form a minimal pair. Moreover, similar results for pairs without greatest predecessors are proved.作者: 安定 時(shí)間: 2025-3-23 21:14
Unsolvable decision problems for PROLOG programs,be recursively unsolvable. A particularly interesting application of this method gives an affirmative answer to Flannagan‘s [1985] conjecture that the floundering property for queries with respect to MU-PROLOG programs is undecidable.作者: GRAZE 時(shí)間: 2025-3-23 23:09 作者: 指派 時(shí)間: 2025-3-24 05:11 作者: peak-flow 時(shí)間: 2025-3-24 09:25 作者: 注意到 時(shí)間: 2025-3-24 14:33 作者: 多骨 時(shí)間: 2025-3-24 16:43 作者: 暗指 時(shí)間: 2025-3-24 21:25 作者: 泄露 時(shí)間: 2025-3-25 00:12 作者: Mumble 時(shí)間: 2025-3-25 06:01 作者: 條街道往前推 時(shí)間: 2025-3-25 10:43
The benefit of microworlds in learning computer programming,作者: concert 時(shí)間: 2025-3-25 12:38
Skolem normal forms concerning the least fixpoint,作者: 有效 時(shí)間: 2025-3-25 18:19 作者: 痛得哭了 時(shí)間: 2025-3-25 21:14
Aggregating inductive expertise on partial recursive functions,作者: 頑固 時(shí)間: 2025-3-26 00:26
Book 1987nctions, on reduction classes, on the spectrum problem and on the complexity of cardinality quantifiers in predicate logic and in arithmetical hierarchy. He was one of the first to pursue the interaction of logic and computer science. The volume reflects the wide spectrum of Dieter R?dding‘s scienti作者: Condense 時(shí)間: 2025-3-26 06:58 作者: cloture 時(shí)間: 2025-3-26 10:43 作者: Fantasy 時(shí)間: 2025-3-26 12:55
First-order spectra with one variable,f sets of positive integers accepted by a Nondeterministic Random Access Machine in time cn (where n is the input integer) and SPECTRA (?1, unary) is the class of finite spectra of (?1, unary)-sentences. Another consequence is that some graph properties (hamiltonicity, connectedness) can be characterized by sentences with only one variable.作者: 違法事實(shí) 時(shí)間: 2025-3-26 19:32 作者: OFF 時(shí)間: 2025-3-26 21:00 作者: 新字 時(shí)間: 2025-3-27 04:55 作者: IST 時(shí)間: 2025-3-27 07:27
Existential fixed-point logic,ogic instead of first-order logic removes the expressivity hypothesis in Cook‘s completeness theorem for Hoare logic. (3) In the presence of a successor relation, existential fixed-point logic captures polynomial time.作者: 放大 時(shí)間: 2025-3-27 12:16 作者: GLOOM 時(shí)間: 2025-3-27 15:10 作者: 艱苦地移動(dòng) 時(shí)間: 2025-3-27 17:47 作者: 繁忙 時(shí)間: 2025-3-27 23:33
Unsolvable decision problems for PROLOG programs,be recursively unsolvable. A particularly interesting application of this method gives an affirmative answer to Flannagan‘s [1985] conjecture that the floundering property for queries with respect to MU-PROLOG programs is undecidable.作者: 關(guān)節(jié)炎 時(shí)間: 2025-3-28 04:51 作者: CARK 時(shí)間: 2025-3-28 08:35
Randomness, provability, and the separation of Monte Carlo Time and space,em. For probabilistic complexity classes with deterministically constructible bounds the standard diagonalization techniques can be applied and yield at least as dense hierarchies as in the deterministic case. For Monte Carlo (i.e. bounded error probability) classes the situation is quite different.作者: Tartar 時(shí)間: 2025-3-28 12:04 作者: 責(zé)怪 時(shí)間: 2025-3-28 16:38 作者: 退潮 時(shí)間: 2025-3-28 18:49 作者: 叫喊 時(shí)間: 2025-3-28 23:10 作者: elucidate 時(shí)間: 2025-3-29 04:54 作者: 虛弱的神經(jīng) 時(shí)間: 2025-3-29 09:21 作者: 熱情的我 時(shí)間: 2025-3-29 12:14
Mohammad Kazem Haki,Christine Legnerentary material: .?This textbook on Linear and Nonlinear Optimization is intended for graduate and advanced undergraduate students in operations research and related fields. It is both literate and mathematically strong, yet requires no prior course in optimization. As suggested by its title, the bo作者: motor-unit 時(shí)間: 2025-3-29 19:20
Bruno S. Freyons (FICTA 2015).Presents theory and applications in Intelli.The proceedings of the 4th?International?Conference?on Frontiers in Intelligent Computing: Theory and Applications 2015 (FICTA 2015) serves as the knowledge centre not only for scientists and researchers in the field of intelligent computi作者: Vulnerable 時(shí)間: 2025-3-29 21:34 作者: 肉體 時(shí)間: 2025-3-30 02:42
Handling Semantic Inconsistencies in Distributed Knowledge Systems Using Ontologiesissue a query. Due to the complexity of the database applications, the so called global queries can be posed which traditional query answering systems can not handle. In this paper a query answering system based on distributed data mining is presented to rectify these problems. Task ontologies are u作者: panorama 時(shí)間: 2025-3-30 07:39 作者: 小步走路 時(shí)間: 2025-3-30 09:31 作者: 茁壯成長(zhǎng) 時(shí)間: 2025-3-30 13:15
Book 2012ents suffering from these conditions is involved and the corresponding impact for the Health Institutions and the Society is dramatically increasing. Although LTOT is well known and widely used since long ago in most modern countries, it still represents a challenging topic due to the huge amount of作者: correspondent 時(shí)間: 2025-3-30 18:23 作者: 抗生素 時(shí)間: 2025-3-30 21:06 作者: CHAR 時(shí)間: 2025-3-31 03:19
Development of a Microreactor for Chemical Production chemical processing system. Ultimately microengineering is another arm of process intensification and as such should considerably enhance the reduction of plant size and the improvement of plant safety.作者: concentrate 時(shí)間: 2025-3-31 05:54
ncial and Medical Identity Theft also presents an overview of the current technology for identity management. The book closes with a series of vignettes in the last chapter, looking at the risks we may see in the future and how these risks can be mitigated or avoided..978-1-4899-9081-5978-1-4614-1918-1作者: 帶來(lái)墨水 時(shí)間: 2025-3-31 10:24
Weishu Hu,Haitao Zou,Zhiguo Gongdered. This interaction may be (a) pre-synaptic (Models 5.1 to 5.4 and 9.2) or post-synaptic (Models 6.1, 6.2, 8.3 to 8.6 and 9.3 to 9.5) (b) independent (Models 5.1, 5.2, 6.1, 6.2, 8.3 to 8.5, 9.3 and 9.4) or dependent (Models 5.3, 5.4, 8.6 and 9.5).作者: 使服水土 時(shí)間: 2025-3-31 15:14
Book 2015bject” with some historical background on observations and instrumentation. In the next chapter, the various forms of prominences are described with a thorough attempt of classification. Their thermodynamic (and velocity) properties are then derived with emphasis on the methods (and their limits) us作者: 禁令 時(shí)間: 2025-3-31 20:44 作者: shrill 時(shí)間: 2025-4-1 00:39
James M. Humber,Robert F. Almedermentary knowledge of mathematics and physics, including continuum mechanics and solution methods for ordinary differential equations. The book consists of four parts. Part I (chapters 1 - 4) is a very brief introduction to ocean circulation and the mathematical formulation of the governing equations作者: Agnosia 時(shí)間: 2025-4-1 02:19
