標題: Titlebook: Mathematical Foundations of Computer Science 1992; 17th International S Ivan M. Havel,Václav Koubek Conference proceedings 1992 Springer-Ve [打印本頁] 作者: Nutraceutical 時間: 2025-3-21 16:13
書目名稱Mathematical Foundations of Computer Science 1992影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 1992影響因子(影響力)學科排名
書目名稱Mathematical Foundations of Computer Science 1992網(wǎng)絡公開度
書目名稱Mathematical Foundations of Computer Science 1992網(wǎng)絡公開度學科排名
書目名稱Mathematical Foundations of Computer Science 1992被引頻次
書目名稱Mathematical Foundations of Computer Science 1992被引頻次學科排名
書目名稱Mathematical Foundations of Computer Science 1992年度引用
書目名稱Mathematical Foundations of Computer Science 1992年度引用學科排名
書目名稱Mathematical Foundations of Computer Science 1992讀者反饋
書目名稱Mathematical Foundations of Computer Science 1992讀者反饋學科排名
作者: GRAZE 時間: 2025-3-21 22:15
Avi Wigderson Sch?digungen wie z. B. Sch?del-Hirn-Traumata, Schlaganf?lle, Rückenmarkssch?digungen, Myasthenia gravis oder Multiple Sklerose zurückzuführen sind, k?nnen Schluckst?rungen auch im Rahmen von rheumatoider Arthritis und Sklerodermie oder bei anatomischen Ver?nderungen im kraniozervikalen Bereich, als作者: 詳細目錄 時間: 2025-3-22 01:07
Holger Bast,Martin Dietzfelbinger,Torben Hagerupitung in auf- und absteigenden Bahnsystemen als auch der intrinsischen Rückenmarksfunktionen. Die resultierende Symptomatik h?ngt dabei weniger von der Ursache der Sch?digung als von der H?he und Geschwindigkeit ab, mit der sie sich entwickelt hat. Eine komplette Querschnittsl?hmung beinhaltet einen作者: MOAT 時間: 2025-3-22 06:10 作者: 震驚 時間: 2025-3-22 12:19
Parallel recognition and ranking of context-free languages,hine without write conflicts. The efficiency of the algorithm is the total number of operations (the product of time and number of processors). Such efficiency depends heavily on the class of context-free grammars and on the meaning of ‘fast’: log(n), log.n or sublinear time. The slower is the algor作者: VERT 時間: 2025-3-22 13:49 作者: Medley 時間: 2025-3-22 19:32
Methods in parallel algorithmcs,c studies for parallel computers..Some of the collective knowledge-base on non-numerical parallel algorithms can be characterized in a structural way. Each structure relates a few problems and technique to one another from the basic to the more involved. The second half of the talk will: (1) overvie作者: 先驅 時間: 2025-3-23 00:52
On the complexity of small description and related topics,problem of obtaining the polynomial size circuits for a given set in P/poly by using the set as an oracle. Recent results on upper and lower bounds of the relative complexity of this problem are presented. We also introduce two related research topics — query learning and identity mapping network — 作者: chiropractor 時間: 2025-3-23 02:22 作者: 有助于 時間: 2025-3-23 08:05 作者: Petechiae 時間: 2025-3-23 10:44
Some remarks on the test complexity of iterative logic arrays,onsidered. We prove that the . of such an ILA is either constant or linear in the length of the ILA. The determination of the test complexity and the specification of the test set can be carried out by algorithms whose complexity only depends on the individual cell function of the ILA. . which chara作者: Silent-Ischemia 時間: 2025-3-23 17:54
The degree structure of 1-L reductions,mplete sets for PSPACE that are not 1-L isomorphic. In other words, the 1-L complete degree for PSPACE does not collapse. This contrasts a result of Allender who showed that all 1-L complete sets for PSPACE are polynomial-time isomorphic. Since all 1-L complete sets for PSPACE are equivalent under 1作者: debris 時間: 2025-3-23 19:24 作者: Serenity 時間: 2025-3-24 02:09
Rational transductions and complexity of counting problems,r and context-free languages. This approach allows to obtain old and new results on the complexity of ranking and unranking as well as on other problems concerning the number of prefixes, suffixes, subwords and factors of a word which belong to a fixed language. Other results concern a suboptimal co作者: 敘述 時間: 2025-3-24 04:40 作者: 出處 時間: 2025-3-24 09:11 作者: Anecdote 時間: 2025-3-24 11:18 作者: Anthrp 時間: 2025-3-24 15:25 作者: DIKE 時間: 2025-3-24 21:50
Graph layout problems,In this paper we survey the recent results and open questions about some graph layout problems.作者: 搜集 時間: 2025-3-24 23:50
Neural networks and complexity theory,We survey some of the central results in the complexity theory of neural networks, with pointers to the literature.作者: enmesh 時間: 2025-3-25 06:55
Theory of computation over stream algebras, and its applications,The theory of computable functions on abstract data types is outlined. Methods for extending the theory to establish the scope and limits of computation on streams over abstract data types arc described. Applications of these methods to the theory of synchronous concurrent algorithms are discussed.作者: 事物的方面 時間: 2025-3-25 08:31 作者: 憤慨一下 時間: 2025-3-25 12:54
Strong normalization of substitutions,λσ-calculus is an extended λ-calculus where substitutions are handled explicity. We prove the strong normalization of its subcalculus . which computes substitutions.作者: 花束 時間: 2025-3-25 19:42 作者: 整頓 時間: 2025-3-25 23:47 作者: 音樂會 時間: 2025-3-26 03:27 作者: parsimony 時間: 2025-3-26 05:11 作者: EXCEL 時間: 2025-3-26 11:45
Negation elimination in equational formulae,sentation of terms defined by counter-examples” [10]. The above results are extended to quotients of the free algebra by a congruence =. which can be generated by a set of shallow permulative equations ..作者: progestin 時間: 2025-3-26 12:43 作者: 榮幸 時間: 2025-3-26 18:59 作者: CHOP 時間: 2025-3-26 22:49
Holger Bast,Martin Dietzfelbinger,Torben Hagerupompletten Querschnittsl?hmung kann diffus, d.h. alle aufsteigenden oder absteigenden Funktionen sind in unterschiedlichem Ma?e beeintr?chtigt, oder fokal sein. In letzterem Fall lassen sich die Sch?digungs-muster lokalisatorisch genauer eingrenzen wie z. B. beim Hinterstrangsyn-drom oder dem spinale作者: 售穴 時間: 2025-3-27 01:35
Conference proceedings 1992tworks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.作者: 清楚說話 時間: 2025-3-27 05:56
0302-9743 neural networks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.978-3-540-55808-8978-3-540-47291-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使無效 時間: 2025-3-27 12:58
0302-9743 s of Computer Science,held in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately inPolandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality researchin all branches oftheoretical com作者: arrhythmic 時間: 2025-3-27 15:17 作者: Harpoon 時間: 2025-3-27 21:06 作者: 客觀 時間: 2025-3-28 01:48 作者: 纖細 時間: 2025-3-28 03:36
Conference proceedings 1992ter Science,held in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately inPolandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality researchin all branches oftheoretical computer scie作者: chandel 時間: 2025-3-28 06:50 作者: 在前面 時間: 2025-3-28 12:55
A perfect parallel dictionary,et batch..Our best results are obtained for a new variant of the CRCW PRAM model of computation called the OR PRAM. For other variants of the CRCW PRAM we show slightly weaker results, with some resource bounds increased by a factor of ?(log..), where . ? is fixed but arbitrarily large.作者: ambivalence 時間: 2025-3-28 17:59 作者: 薄膜 時間: 2025-3-28 20:25
The degree structure of 1-L reductions,-L reductions that are one-one and quadratically length-increasing this also provides an example of a ≤.-degree that does not collapse to a single 1-L isomorphism type..Relatedly, we prove that there exist two sets . and . that are ≤. equivalent but not ≤. equivalent. That is, there is a one-one 1-L degree that is no honest one-one 1-L degree.作者: 時間等 時間: 2025-3-29 00:06 作者: Indolent 時間: 2025-3-29 06:40
Parallel recognition and ranking of context-free languages, of certain (⊕,?)-transitive closure problems, where (⊕,?)=(+,.) for the ranking problem of unambiguous languages and (⊕,?)=(max,concat) for the max-word problem. This simplifies the ranking and max-word algorithms and reduces the number of processors.作者: 跑過 時間: 2025-3-29 09:58 作者: 音樂學者 時間: 2025-3-29 12:27
A Discourse on the Norms and Ideologies of Peacekeepingy or prevent conflict areas from becoming terrorist enclaves, which has been a major goal in the global war on terror since the September 11 attacks (Ramsbotham/Woodhouse .; Hultman .). This approach to peace studies impedes reflections on what is already known and limits activities in this area to 作者: 龍蝦 時間: 2025-3-29 17:28
Strategies and Techniques for NK Cell Phenotyping,r. Although cancer immunotherapy can result in long-lasting clinical responses, the majority of patients do not respond or develop resistance. Furthermore, cancer immunotherapy is being increasingly combined with other forms of immunotherapy or conventional cancer therapies. It is therefore much nee作者: Prognosis 時間: 2025-3-29 22:03 作者: climax 時間: 2025-3-30 01:26 作者: 幼稚 時間: 2025-3-30 04:23 作者: 難取悅 時間: 2025-3-30 11:47
Internet, Educational Disparities, and Economic Growth: Differences Between Low-Middle and High-Incodeveloping countries. The results highlight that in addition to the role played by the level of human capital, public policies should take into account the educational distribution to boost Internet use and favor its impacts on economic growth.作者: 背叛者 時間: 2025-3-30 14:18
Frege, Gottlob, dafür, da? der Psychologismus sich aus den Logik-Debatten verabschieden mu?te, sondern begründete mit seinen Ergebnissen zugleich eine neue Denkart in der wissenschaftlichen Selbstverst?ndigung der Philosophie.作者: 慷慨不好 時間: 2025-3-30 19:36
B. Angermann,H. D. Doebner,J. Tolartromechanical actuators, separation membranes, filled polymer composites,and drug-delivery systems are some of the possible applications that havebeen demonstrated in the laboratories. We further discuss the status of thisfield and point out the value-added applications that exist today versus there作者: 善于 時間: 2025-3-31 00:24
Anurag S. Rathore,S. Muthukumarts way into advanced chip designs. The second part of the book describes the most important passive devices used in millimetre-wave CMOS circuits. Part three uses these passive devices and builds circuit blocks for the wireless transceiver. The book completes with a comprehensive list of references 作者: Focus-Words 時間: 2025-3-31 03:40
Surgical management of proliferative diabetic retinopathy,key points may be emphasized: (i) A unilateral vitreous hemorrhage in the absence of other enumerated risk factors is not in itself reason for vitrectomy and may be followed by repetitive ultrasound scans, (ii) After a vitreous hemorrhage, delay in referral to a surgeon skilled in vitreous surgery m作者: Dendritic-Cells 時間: 2025-3-31 06:29
Yu. I. Kruzhilinand two-component ceramic shields. Despite the massive use of mathematical techniques, the obtained results have a clear engineering meaning and are presented in an easy-to-use form. One of the chapters is devo978-90-481-6868-2978-1-4020-4239-3Series ISSN 0925-0042 Series E-ISSN 2214-7764 作者: Obverse 時間: 2025-3-31 10:48 作者: 徹底明白 時間: 2025-3-31 14:10 作者: infatuation 時間: 2025-3-31 17:55
