標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 1990; Banska Bystrica, Cze Branislav Rovan Conference proceedings 1990 Springer-Verlag Berlin [打印本頁(yè)] 作者: CANTO 時(shí)間: 2025-3-21 16:52
書目名稱Mathematical Foundations of Computer Science 1990影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 1990影響因子(影響力)學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 1990網(wǎng)絡(luò)公開度
書目名稱Mathematical Foundations of Computer Science 1990網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 1990被引頻次
書目名稱Mathematical Foundations of Computer Science 1990被引頻次學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 1990年度引用
書目名稱Mathematical Foundations of Computer Science 1990年度引用學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 1990讀者反饋
書目名稱Mathematical Foundations of Computer Science 1990讀者反饋學(xué)科排名
作者: 固執(zhí)點(diǎn)好 時(shí)間: 2025-3-21 20:19 作者: 滲透 時(shí)間: 2025-3-22 02:07 作者: 來(lái)自于 時(shí)間: 2025-3-22 07:12
Using inductive counting to simulate nondeterministic computation,Relatedly, we show that unique AuxPDAs, logspace reductions to unambiguous context-free languages, and PRAMs can efficiently simulate ambiguity-bounded nondeterministic computation. In particular, all nondeterministic logspace languages of polynomial ambiguity are in CREW., and thus have fast parallel algorithms.作者: GLADE 時(shí)間: 2025-3-22 12:37 作者: Galactogogue 時(shí)間: 2025-3-22 16:37
One-way functions in complexity theory,ms. The complexity of inverting one-way functions will follow from these relationships. Then, we will survey various forms of one-way functions that have arisen in relationship to some cryptographic investigations and in relationship to the Isomorphism Problem.作者: fibula 時(shí)間: 2025-3-22 18:39
0302-9743 at Banská Bystrica, Czechoslovakia, August 27-31, 1990. Previous MFCS proceedings have also been published in the Lecture Notes in Computer Science. This symposium is the 15th in a series of international meetings which have taken place in Czechoslovakia and Poland. The aim of these symposia is to b作者: Angiogenesis 時(shí)間: 2025-3-22 22:48 作者: Calibrate 時(shí)間: 2025-3-23 01:59 作者: Airtight 時(shí)間: 2025-3-23 09:13 作者: obligation 時(shí)間: 2025-3-23 11:19 作者: 做作 時(shí)間: 2025-3-23 16:12
Mathematical Foundations of Computer Science 1990978-3-540-47185-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 執(zhí) 時(shí)間: 2025-3-23 18:31
On kleene algebras and closed semirings,mata theory, and the design and analysis of algorithms. The literature contains at several inequivalent definitions of Kleene algebras and related algebraic structures [2,13,14,5,6,1,9,7]..In this paper we establish some new relationships among these structures. Our main results are:作者: 樹膠 時(shí)間: 2025-3-24 01:46 作者: Canopy 時(shí)間: 2025-3-24 06:25
Some properties of zerotesting bounded one-way multicounter machines,chy of zerotesting bounded deterministic counter machine languages. Second, we show that a nondeterministic two-counter machine with 2 zerotests is able to recognize a language which cannot be accepted by any deterministic sublinear zerotesting bounded multicounter machine.作者: 使增至最大 時(shí)間: 2025-3-24 07:01 作者: 新星 時(shí)間: 2025-3-24 11:01
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626124.jpg作者: FLASK 時(shí)間: 2025-3-24 17:34 作者: 殺菌劑 時(shí)間: 2025-3-24 19:57 作者: 庇護(hù) 時(shí)間: 2025-3-25 03:11 作者: notice 時(shí)間: 2025-3-25 04:33 作者: 空氣 時(shí)間: 2025-3-25 07:35
Jean-Pierre Jouannaudine au?erordentlich gro?e Bedeutung. Es gibt schlechthin keine Krankheit oder auch nur Unp??lichkeit, bei der nicht vegetative Regulations- oder Innervationsst?rungen eine Rolle spielen. Die Palette reicht vom leichten Spannungskopfschmerz bis zum Zusammenbruch lebensnotwendiger Funktionen. Gleichwo作者: FLAIL 時(shí)間: 2025-3-25 12:10
Dexter Kozensie ungenügend geprüft für psychosomatisch erkl?rt, sind sie Teil eines komplexen neurologischen Syndroms, dann werden sie nicht erfragt oder berücksichtigt. In den Lehrbüchern der Neurologie werden sie meist nur beil?ufig gestreift und allenfalls bei den Querschnittsl?hmungen kurz genannt. Dies tri作者: 青少年 時(shí)間: 2025-3-25 17:18 作者: 弄皺 時(shí)間: 2025-3-25 21:43 作者: 石墨 時(shí)間: 2025-3-26 00:28 作者: Projection 時(shí)間: 2025-3-26 07:26
Jacobo Toránncludes supplementary material: "Neurologie für Praktiker" wendet sich an alle Kollegen, die neurologische Patienten in Klinik und Praxis betreuen. Ziel des Buches ist es, eine schnelle Orientierung in den komplexen neurologischen Krankheitsbildern zu erm?glichen, aktuelle Therapiekonzepte verst?ndl作者: gregarious 時(shí)間: 2025-3-26 09:57 作者: mastoid-bone 時(shí)間: 2025-3-26 13:32 作者: Debrief 時(shí)間: 2025-3-26 18:55 作者: Agronomy 時(shí)間: 2025-3-26 21:25
Sanjoy K. Baruah,Rodney R. Howell,Louis E. Rosierncludes supplementary material: "Neurologie für Praktiker" wendet sich an alle Kollegen, die neurologische Patienten in Klinik und Praxis betreuen. Ziel des Buches ist es, eine schnelle Orientierung in den komplexen neurologischen Krankheitsbildern zu erm?glichen, aktuelle Therapiekonzepte verst?ndl作者: Tinea-Capitis 時(shí)間: 2025-3-27 02:02 作者: 佛刊 時(shí)間: 2025-3-27 07:36 作者: 秘密會(huì)議 時(shí)間: 2025-3-27 09:56
Ivana ?ernāncludes supplementary material: "Neurologie für Praktiker" wendet sich an alle Kollegen, die neurologische Patienten in Klinik und Praxis betreuen. Ziel des Buches ist es, eine schnelle Orientierung in den komplexen neurologischen Krankheitsbildern zu erm?glichen, aktuelle Therapiekonzepte verst?ndl作者: foppish 時(shí)間: 2025-3-27 14:32 作者: Kernel 時(shí)間: 2025-3-27 17:49 作者: 進(jìn)入 時(shí)間: 2025-3-28 01:54
A logical operational semantics of full Prolog,ach is based on (essentially first-order) structures that evolve over time and are finite in the same way as real computers are (so-called “dynamic algebras”). See Gurevich 1988 for the idea of dynamic algebras and its application to an operational semantics for Modula 2 (Gurevich & Morris 1988), Sm作者: Overthrow 時(shí)間: 2025-3-28 03:36
Syntactic theories,, unification problems are usually transformed step by step until a solved form is reached from which a most general unifier can be obtained. Kirchner showed how to compute transformation rules for theories having a ., for which a proof of an arbitrary equation uses at most one top equality step. Co作者: bizarre 時(shí)間: 2025-3-28 08:50 作者: EVADE 時(shí)間: 2025-3-28 11:51
Restricted branching programs and their computational power,decision trees, read-once-only branching programs length-restricted oblivious branching programs and width-restricted branching programs. In the following we survey some results which characterize the computational power of such restricted models. Interestingly, we are able to establish strong diffe作者: 橢圓 時(shí)間: 2025-3-28 16:59
One-way functions in complexity theory,able in polynomial time. We will examine relationships between the complexity of functional computational problems and ordinary set recognition problems. The complexity of inverting one-way functions will follow from these relationships. Then, we will survey various forms of one-way functions that h作者: overweight 時(shí)間: 2025-3-28 21:23 作者: instructive 時(shí)間: 2025-3-29 02:09
On preemptive scheduling of periodic, real-time tasks on one processor, Simultaneous Congruences Problem is NP-complete in the strong sense. Although this result is included primarily as a lemma for showing our next major theorem, it is important in its own right, answering a question that has been open for ten years. Our second major result is perhaps the most importa作者: Nibble 時(shí)間: 2025-3-29 03:57 作者: Condense 時(shí)間: 2025-3-29 10:54
Using inductive counting to simulate nondeterministic computation,with no space penalty any reasonable acceptance mechanism based on censuses of configurations. However, the efficiency with which other acceptance mechanisms can simulate nondeterminism remains an open question. This paper uses inductive counting to study the cost of simulating nondeterminism with V作者: 四牛在彎曲 時(shí)間: 2025-3-29 13:36
Some properties of zerotesting bounded one-way multicounter machines,chy of zerotesting bounded deterministic counter machine languages. Second, we show that a nondeterministic two-counter machine with 2 zerotests is able to recognize a language which cannot be accepted by any deterministic sublinear zerotesting bounded multicounter machine.作者: 剛毅 時(shí)間: 2025-3-29 16:29
Decomposition of semi commutations, of the alphabet. We prove that semi commutations can be decomposed in weaker semi commutations if and only if they are not atomic. We then deduce that every semi commutation can be obtained by a composition of atomic semi commutations and we suggest a decomposition algorithm.作者: hysterectomy 時(shí)間: 2025-3-29 20:35 作者: 飛鏢 時(shí)間: 2025-3-30 01:17
A logical operational semantics of full Prolog, as a result of the inherent extensibility of dynamic algebra semantics, we are able to proceed by stepwise refinement..We give this semantics for the full language of Prolog including all the usual non-logical built-in predicates. Our specific aim is to provide a mathematically precise but simple f作者: 無(wú)能力之人 時(shí)間: 2025-3-30 07:40 作者: Ringworm 時(shí)間: 2025-3-30 09:54 作者: 顧客 時(shí)間: 2025-3-30 13:47
Jean-Pierre Jouannaudweil sie auf der Universit?t nichts oder nur Sp?rliches davon geh?rt haben. Sie behelfen sich mit dem nichtssagenden Begriff der ?Vegetativen Dystonie“ und therapieren symptomatisch. Die wissenschaftlich orientierten Kliniker scheuen das ?Vegetativum“, weil es verschwommen oder sogar unseri?s ersche作者: 不真 時(shí)間: 2025-3-30 17:21
Dexter Kozenhes oder charakteristisches Teilsymptom sind. Diese sollen hier dargestellt werden. Sehr wichtig ist, da? der Arzt gezielt nach solchen St?rungen fragt, denn viele Kranke verschweigen auch heute im Zeitalter der sexuellen Emanzipation nach wie vor diesen Teilaspekt ihres Krankheitsbildes.
