標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 1996; 21st International S Wojciech Penczek,Andrzej Sza?as Conference proceedings 1996 Springe [打印本頁(yè)] 作者: 你太謙虛 時(shí)間: 2025-3-21 17:59
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996影響因子(影響力)
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996被引頻次
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996被引頻次學(xué)科排名
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996年度引用
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996年度引用學(xué)科排名
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996讀者反饋
書(shū)目名稱(chēng)Mathematical Foundations of Computer Science 1996讀者反饋學(xué)科排名
作者: 避開(kāi) 時(shí)間: 2025-3-22 00:17
Partial order reduction: Model-checking using representatives,the property to be checked. Applying the reduction constructs a reduced state-space that generates at least one representative for each equivalence class. This paper surveys some algorithms for partial order model-checking. The presentation focuses on the . approach. The reduction approach is extended to branching specifications.作者: Arthritis 時(shí)間: 2025-3-22 00:54
Bisimilarity problems requiring exponential time (Extended abstract),is calculus and thus that exponential time is . in order to solve it. We then prove that, if we add a . operator to the calculus, and we impose that parallel composition is never used inside recursive definitions, then the bisimilarity problem is still EXP-complete, thus no harder than in the fragment without parallel composition.作者: Density 時(shí)間: 2025-3-22 05:35
Conference proceedings 1996d 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.作者: 轉(zhuǎn)換 時(shí)間: 2025-3-22 10:14 作者: Flirtatious 時(shí)間: 2025-3-22 13:47
A sequent calculus for subtyping polymorphic types,ive structures. The systems are complete with respect to this semantics. The logic which emerges from this paper can be seen as a successor to the original Hilbert style system proposed by J. Mitchell in 1988, and to the “half way” sequent calculus of G. Longo, K. Milsted and S. Soloviev proposed in 1995.作者: 行乞 時(shí)間: 2025-3-22 18:55 作者: 諂媚于人 時(shí)間: 2025-3-23 01:11
Linear time temporal logics over Mazurkiewicz traces,eoretic methods for solving the satisfiability and model checking problems for these logics. It turns out that we still do not know what the “canonical” linear time temporal logic over Mazurkiewicz traces looks like. We identify here the criteria that should be met by this elusive logic.作者: 態(tài)學(xué) 時(shí)間: 2025-3-23 02:11
On the query complexity of sets,e important than Turing degree..We investigate when extra queries add power. We show that, for several nonrecursive sets ., the more queries you can ask, the more sets you can decide; however, there are sets for which more queries do not help at all.作者: 無(wú)能的人 時(shí)間: 2025-3-23 05:38
Shortest path problems with time constraints,d. Finally, we consider the general case where there is a vertex-dependent upper bound on the waiting time at each vertex. Several algorithms with pseudopolynomial time complexity are proposed to solve the problems. First we assume that all transit times . are positive integers. In the last section, we show how to include zero transit times.作者: 純樸 時(shí)間: 2025-3-23 11:32 作者: 露天歷史劇 時(shí)間: 2025-3-23 16:01 作者: voluble 時(shí)間: 2025-3-23 21:09
Logic of predicates with explicit substitutions,We present a non-commutative linear logic — the logic of predicates with equality and .. Thus, the position of linear logic with respect to the usual logic is given a new explanation.作者: transient-pain 時(shí)間: 2025-3-23 22:12 作者: nocturia 時(shí)間: 2025-3-24 04:50 作者: abduction 時(shí)間: 2025-3-24 07:49
Parallel Alternating-Direction Access Machine,ion of the multiprocessor computers . and a prototype architecture .. The main feature of . is the organization of access to the global memory:.Since the . processors have such a restricted access to the partially shared memory, developing tools to enhance flexibility of access to the memory is important. The paper concentrates on these issues.作者: Kindle 時(shí)間: 2025-3-24 12:39
https://doi.org/10.1007/3-540-61550-4Algorithmen; Komlexit?t; Mathematische Logik; Programmiertheorie; algorithms; calculus; complexity; formal 作者: COMMA 時(shí)間: 2025-3-24 15:34 作者: 固定某物 時(shí)間: 2025-3-24 19:57 作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-24 23:44 作者: Observe 時(shí)間: 2025-3-25 04:04 作者: 不近人情 時(shí)間: 2025-3-25 08:05
Edmund M. Clarke Jr.he neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering, as it doe作者: exorbitant 時(shí)間: 2025-3-25 12:02
Volker Diekert,Anca Muschollhe neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering, as it doe作者: CROAK 時(shí)間: 2025-3-25 18:12
Alan Gibbons,Martyn Amos,David Hodgsonhe neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering, as it doe作者: frivolous 時(shí)間: 2025-3-25 23:46 作者: Generalize 時(shí)間: 2025-3-26 02:39 作者: 卵石 時(shí)間: 2025-3-26 06:46 作者: 表皮 時(shí)間: 2025-3-26 08:59 作者: 整潔 時(shí)間: 2025-3-26 16:39
Donald Sannella,Andrzej Tarleckitient in the neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering,作者: 誘導(dǎo) 時(shí)間: 2025-3-26 17:39
Jerzy Tiurynhe neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering, as it doe作者: GEON 時(shí)間: 2025-3-27 00:09
Vladimir A. Uspenskytient in the neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering,作者: antiquated 時(shí)間: 2025-3-27 03:32
Philippe Balbianitient in the neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering,作者: ARCHE 時(shí)間: 2025-3-27 06:31
Gabriel A. Baum,Marcelo F. Frias,Armando M. Haeberer,Pablo E. Martínez Lópezhe neurology clinic? Or, are these your own symptoms to the prospect of sitting for the neurology board exam? Neurology Study Guide: Oral Board Examination Review will help alleviate your exam-related symptoms. ...Part of the challenge of the exam is due to its breadth and depth, covering, as it doe作者: Pillory 時(shí)間: 2025-3-27 09:49
Marek A. Bednarczyk other neurosciences in the health and well-being of Americans. It has been suggested that as many as 20% of all patients seeking medical treatment have neurologic problems, either as the presenting complaint or as an associated condition complicating the primary illness. Thus, it is fitting that Sp作者: 值得贊賞 時(shí)間: 2025-3-27 15:48
Richard Beigel,William Gasarch,Martin Kummer,Georgia Martin,Timothy McNicholl,Frank Stephan other neurosciences in the health and well-being of Americans. It has been suggested that as many as 20% of all patients seeking medical treatment have neurologic problems, either as the presenting complaint or as an associated condition complicating the primary illness. Thus, it is fitting that Sp作者: 楓樹(shù) 時(shí)間: 2025-3-27 19:29 作者: institute 時(shí)間: 2025-3-27 23:36
Michele Boreale,Luca Trevisanrosciences in the health and well-being of Americans. It has been suggested that as many as 20% of all patients seeking medical treatment have neurologic problems, either as the presenting complaint or as an associated condition complicating the primary illness. Thus, it is fitting that Springer-Ver作者: 脫毛 時(shí)間: 2025-3-28 02:17
Arie de Bruin,S. H. Nienhuys-Cheng other neurosciences in the health and well-being of Americans. It has been suggested that as many as 20% of all patients seeking medical treatment have neurologic problems, either as the presenting complaint or as an associated condition complicating the primary illness. Thus, it is fitting that Sp作者: 逃避責(zé)任 時(shí)間: 2025-3-28 06:44 作者: 糾纏 時(shí)間: 2025-3-28 12:32 作者: padding 時(shí)間: 2025-3-28 14:42
Code problems on traces,iew of the current state of some basic questions in this field. Among these, we consider the existence problem for strong codings, clique-preserving morphisms and the unique decipherability problem (code problem).作者: unstable-angina 時(shí)間: 2025-3-28 19:46
Models of DNA computation,elivered his famous paper describing sub-microscopic computers. Recently, several papers have advocated the realisation of massively parallel computation using the techniques and chemistry of molecular biology. Algorithms are not executed on a traditional, siliconbased computer, but instead employ t作者: 外面 時(shí)間: 2025-3-29 00:08 作者: 撫育 時(shí)間: 2025-3-29 03:13 作者: 寬大 時(shí)間: 2025-3-29 10:35 作者: collagen 時(shí)間: 2025-3-29 12:03
Mind the gap! Abstract versus concrete models of specifications, modelled as ordinary functions. The theory that underlies the formal development of programs from specifications takes advantage of the many useful properties that these models enjoy..The models that underlie the semantics of programming languages are different. For example, the semantics of Standa作者: 諂媚于人 時(shí)間: 2025-3-29 17:41 作者: enterprise 時(shí)間: 2025-3-29 20:35 作者: Dislocation 時(shí)間: 2025-3-30 03:33 作者: 愚笨 時(shí)間: 2025-3-30 05:45
On the query complexity of sets,ested in the complexity of certain . in this context. We study the sets ODD.={(x.,..., ..)∶|. ∩ {..,..., ..}| is odd} and WMOD(.).={(..,..., ..)∶|. ∩ {..,..., ..}|?0 (mod .)}..If . or . is semirecursive, we obtain tight bounds on the query complexity of ODD. and WMOD(.).. We obtain lower bounds for 作者: 有發(fā)明天才 時(shí)間: 2025-3-30 09:34 作者: GROUP 時(shí)間: 2025-3-30 15:07 作者: 刪除 時(shí)間: 2025-3-30 18:59
Linear dynamic Kahn networks are deterministic,xecutions provided with the same input streams deliver the same output stream. The Kahn principle has thus far not been proved for dynamic, non-deterministic networks..We consider a simple language . containing the fork-statement. For this language we define a non-deterministic transition system whi作者: Gullible 時(shí)間: 2025-3-31 00:40
Shortest path problems with time constraints,cost ., which are functions of the departure time . at the beginning vertex of the arc. Moreover, postponement of departure (i.e., waiting) at a vertex may be allowed. The problem is to find the shortest path, i.e., the path with the least possible cost, subject to the constraint that the total trav作者: Commodious 時(shí)間: 2025-3-31 01:20
Parallel Alternating-Direction Access Machine,ion of the multiprocessor computers . and a prototype architecture .. The main feature of . is the organization of access to the global memory:.Since the . processors have such a restricted access to the partially shared memory, developing tools to enhance flexibility of access to the memory is impo作者: Entreaty 時(shí)間: 2025-3-31 07:26 作者: Esalate 時(shí)間: 2025-3-31 10:09 作者: needle 時(shí)間: 2025-3-31 15:58 作者: heartburn 時(shí)間: 2025-3-31 18:02
From specifications to programs: A fork-algebraic approach to bridge the gap,e deep significance in the relational statement of first-order expressions involving universal quantifiers. Several algebraic properties of the relational implication are stated showing its usefulness in program calculation. Finally, a non-trivial example of derivation is given to asses the merits o作者: 沙漠 時(shí)間: 2025-3-31 22:45 作者: 消極詞匯 時(shí)間: 2025-4-1 04:59 作者: Meditate 時(shí)間: 2025-4-1 07:49 作者: 招致 時(shí)間: 2025-4-1 11:48
Nonmonotonic rule systems: Forward chaining, constraints, and complexity,
