標(biāo)題: Titlebook: Computer Science - Theory and Applications; Second International Volker Diekert,Mikhail V. Volkov,Andrei Voronkov Conference proceedings 20 [打印本頁] 作者: introspective 時(shí)間: 2025-3-21 17:02
書目名稱Computer Science - Theory and Applications影響因子(影響力)
書目名稱Computer Science - Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Computer Science - Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Computer Science - Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computer Science - Theory and Applications被引頻次
書目名稱Computer Science - Theory and Applications被引頻次學(xué)科排名
書目名稱Computer Science - Theory and Applications年度引用
書目名稱Computer Science - Theory and Applications年度引用學(xué)科排名
書目名稱Computer Science - Theory and Applications讀者反饋
書目名稱Computer Science - Theory and Applications讀者反饋學(xué)科排名
作者: Assemble 時(shí)間: 2025-3-21 20:45
0302-9743 Overview: 978-3-540-74509-9978-3-540-74510-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: BUMP 時(shí)間: 2025-3-22 01:57
https://doi.org/10.1007/978-94-011-1318-2 various resources, making them available only for a determined period of time; we add timers to ambients and capabilities. We present an example how the new model is working. The coordination of the ambients in time and space is given by assigning specific values to timers, and by a set of coordination rules.作者: Cubicle 時(shí)間: 2025-3-22 05:08
https://doi.org/10.1007/978-94-011-1318-2Fs with a planted solution. We rigorously prove that the new algorithm solves the Full CNF with high probability, and for random CNFs with a planted solution of high density finds an assignment that differs from the planted in only .-fraction of variables. In the experiments the algorithm solves random CNFs with a planted solution of any density.作者: reaching 時(shí)間: 2025-3-22 11:19
SpringerBriefs in Molecular Sciencesuch dual linear-hierarchical structure include annotated linguistic data, executions of structured programs, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define .-finite-state acceptors for nested words, and show that the 作者: 敬禮 時(shí)間: 2025-3-22 15:02
https://doi.org/10.1007/978-3-642-32642-4ted Theorem Proving (ATP) systems. These include the TPTP itself, the Thousands of Solutions from Theorem Provers (TSTP) solution library, the CADE ATP System Competition (CASC), tools such as my semantic Derivation Verifier (GDV) and the Interactive Derivation Viewer (IDV), meta-ATP systems such as作者: 敬禮 時(shí)間: 2025-3-22 20:11 作者: 拍下盜公款 時(shí)間: 2025-3-23 01:02
Biological Catalysis and Biotechnology,by deterministic pushdown automata of level .. We extend this definition to sequences of . indexed by .. We give characterisations of these sequences in terms of “higher-order” L-systems. In particular sequences of rational numbers of level 3 are characterised by polynomial recurrences (which genera作者: 大火 時(shí)間: 2025-3-23 02:02
https://doi.org/10.1007/978-94-011-1318-2 various resources, making them available only for a determined period of time; we add timers to ambients and capabilities. We present an example how the new model is working. The coordination of the ambients in time and space is given by assigning specific values to timers, and by a set of coordina作者: erythema 時(shí)間: 2025-3-23 08:02
https://doi.org/10.1007/978-94-011-1318-2Fs with a planted solution. We rigorously prove that the new algorithm solves the Full CNF with high probability, and for random CNFs with a planted solution of high density finds an assignment that differs from the planted in only .-fraction of variables. In the experiments the algorithm solves ran作者: disparage 時(shí)間: 2025-3-23 13:24
Heinrich Caro and Ivan Levinsteinnderlying control logic and each instruction must be reversible. A general class of machine instruction sets was proven to be reversible, building on our concept of reversible updates. The presentation is abstract and can serve as a guideline for a family of reversible processor designs. By example,作者: Alpha-Cells 時(shí)間: 2025-3-23 16:28 作者: Eructation 時(shí)間: 2025-3-23 19:00
Pollution and the Chemical Industrysystem if the conditional probability of the property under some partial observation differs from the a priori probability of that property. For systems modelled as finite Markov chains we prove that the two following problems are decidable: does a system has information flow for a given regular pro作者: 蚊子 時(shí)間: 2025-3-24 02:13
Ernst Homburg,Anthony S. Travisist. Do we have evidence that such functions are hard, for example, if . is computable in polynomial-time does this imply the polynomial-time hierarchy collapses? (By computing a multivalued function in deterministic polynomial-time we mean on every input producing one of the possible values of that作者: Occupation 時(shí)間: 2025-3-24 02:31
Photoeffects at Semiconductor Surfaces,be used to help in the top-down development of structured imperative programs. When a problem is stated, the incremental proof-based methodology of event B [9] starts by stating a very abstract model and further refinements lead to finer-grain event-based models which are used to derive an algorithm作者: GAVEL 時(shí)間: 2025-3-24 10:18
https://doi.org/10.1007/978-1-4899-2498-8rd as in the general case, i.e. . and #. complete. On the other hand, both bipartite planarity and bimodal planarity bring the complexity of permanents down (but no further) to that of determinants. The permanent or the determinant modulo 2 is complete for ⊕., and we show that parity of paths in a l作者: 搖曳 時(shí)間: 2025-3-24 11:58 作者: 有惡臭 時(shí)間: 2025-3-24 16:07 作者: GLIDE 時(shí)間: 2025-3-24 22:50 作者: 心痛 時(shí)間: 2025-3-25 03:01
Timers and Proximities for Mobile Ambients, various resources, making them available only for a determined period of time; we add timers to ambients and capabilities. We present an example how the new model is working. The coordination of the ambients in time and space is given by assigning specific values to timers, and by a set of coordination rules.作者: circumvent 時(shí)間: 2025-3-25 05:15 作者: guardianship 時(shí)間: 2025-3-25 10:42 作者: ADOPT 時(shí)間: 2025-3-25 12:02 作者: 玉米 時(shí)間: 2025-3-25 16:36 作者: 閃光東本 時(shí)間: 2025-3-25 20:19
Elio Santacesaria,Riccardo TesserIn this paper, using the chromatic properties of power graphs we propose a new approach for placing resources in symmetric networks. Our novel placement scheme guarantees a perfect placement when such a solution is feasible in the topology.作者: 形容詞 時(shí)間: 2025-3-26 03:57
,Proving Church’s Thesis,The talk reflects recent joint work with Nachum Dershowitz [4].作者: Generalize 時(shí)間: 2025-3-26 05:44 作者: Filibuster 時(shí)間: 2025-3-26 10:34
Bouillon: A Wiki-Wiki Social Web,The Bouillon project implements the vision termed a “Social Web”. It is an extremely open collaboration environment employing social links for creation, filtering and dissemination of information. It is also an attempt to boost the wiki effect of knowledge crystallization..Currently, the project is in stage of public testing, available at ..作者: Ceremony 時(shí)間: 2025-3-26 12:56 作者: 抗原 時(shí)間: 2025-3-26 19:52
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233817.jpg作者: Tidious 時(shí)間: 2025-3-27 00:30
https://doi.org/10.1007/978-3-540-74510-5Algorithms; Automat; Hardware; artificial intelligence; automata; complexity; computer architecture; comput作者: 擔(dān)憂 時(shí)間: 2025-3-27 03:11 作者: 溝通 時(shí)間: 2025-3-27 07:00
https://doi.org/10.1007/978-3-642-32642-4P System Competition (CASC), tools such as my semantic Derivation Verifier (GDV) and the Interactive Derivation Viewer (IDV), meta-ATP systems such as the Smart Selective Competition Parallelism (SSCPA) system and the Semantic Relevance Axiom Selection System (SRASS), and applications in various domains.作者: NEXUS 時(shí)間: 2025-3-27 09:44 作者: Addictive 時(shí)間: 2025-3-27 16:30
Heinrich Caro and Ivan Levinsteinour concept of reversible updates. The presentation is abstract and can serve as a guideline for a family of reversible processor designs. By example, we illustrate programming principles for the abstract machine architecture formalized in this paper.作者: 果核 時(shí)間: 2025-3-27 17:55 作者: visual-cortex 時(shí)間: 2025-3-28 00:17 作者: HEAVY 時(shí)間: 2025-3-28 03:51 作者: 縮短 時(shí)間: 2025-3-28 10:18
Chemistry and Occurrence of Dioxins,ages. The results imply undecidability of a number of decision problems of unary conjunctive grammars, as well as nonexistence of an r.e. bound on the growth rate of generated languages. An essential step of the argument is a simulation of a cellular automaton recognizing positional notation of numbers using language equations.作者: bioavailability 時(shí)間: 2025-3-28 11:05 作者: Servile 時(shí)間: 2025-3-28 18:03 作者: Callus 時(shí)間: 2025-3-28 21:21 作者: 紡織品 時(shí)間: 2025-3-29 02:51 作者: 生命層 時(shí)間: 2025-3-29 04:35 作者: avarice 時(shí)間: 2025-3-29 10:21 作者: justify 時(shí)間: 2025-3-29 14:22 作者: thalamus 時(shí)間: 2025-3-29 17:53 作者: 流浪 時(shí)間: 2025-3-29 21:56 作者: hereditary 時(shí)間: 2025-3-30 01:19
Ernst Homburg,Anthony S. Travis function on that input.).We give a relativized negative answer to this question by exhibiting an oracle under which . functions are easy to compute but the polynomial-time hierarchy is infinite. We also show that relative to this same oracle, . and . functions are not computable in polynomial-time with an . oracle.作者: 無可非議 時(shí)間: 2025-3-30 05:26
https://doi.org/10.1007/978-1-4899-2498-8ayered grid graph (which is bimodal planar) is also complete for this class. We also relate the complexity of grid graph reachability to that of testing existence/uniqueness of a perfect matching in a planar bipartite graph.作者: 背心 時(shí)間: 2025-3-30 09:11 作者: Affirm 時(shí)間: 2025-3-30 12:54
Inverting Onto Functions and Polynomial Hierarchy, function on that input.).We give a relativized negative answer to this question by exhibiting an oracle under which . functions are easy to compute but the polynomial-time hierarchy is infinite. We also show that relative to this same oracle, . and . functions are not computable in polynomial-time with an . oracle.作者: 娘娘腔 時(shí)間: 2025-3-30 19:04
Planarity, Determinants, Permanents, and (Unique) Matchings,ayered grid graph (which is bimodal planar) is also complete for this class. We also relate the complexity of grid graph reachability to that of testing existence/uniqueness of a perfect matching in a planar bipartite graph.作者: 現(xiàn)暈光 時(shí)間: 2025-3-30 22:55
Equivalence Problems for Circuits over Sets of Natural Numbers,zie and Wagner (2003) studied related . for circuits over sets of natural numbers. Our results also have consequences for these membership problems: We provide an improved upper bound for the case of {?∪?,?∩?, .,?+?,×}-circuits.作者: gout109 時(shí)間: 2025-3-31 02:02
Marrying Words and Trees,ntext-free languages. We argue that for algorithmic verification of structured programs, instead of viewing the program as a context-free language over words, one should view it as a regular language of nested words (or equivalently, as a visibly pushdown language), and this would allow model checki作者: Truculent 時(shí)間: 2025-3-31 08:46 作者: 共同給與 時(shí)間: 2025-3-31 09:43 作者: Oafishness 時(shí)間: 2025-3-31 14:17
Biological Catalysis and Biotechnology,systems. As a results, the validation problem is becoming more complex to solve and is indeed the main limiter for producing a high quality silicon products..Design abstraction and high level modeling is a fundamental design strategy to cope with system complexity. The basic idea is to hide design i作者: elastic 時(shí)間: 2025-3-31 21:18 作者: JAMB 時(shí)間: 2025-4-1 01:39 作者: Hyaluronic-Acid 時(shí)間: 2025-4-1 05:24
Abstract Modeling and Formal Verification of Microprocessors,tects and designers continue to look for ways to take advantage from it to produce ever more complex microprocessors. Meanwhile, market forces are dictating a shorter time to market, a proliferation of product and steeper volume ramps in production. However, it is evident that logic correctness is o作者: 凌辱 時(shí)間: 2025-4-1 07:18
Sequences of Level 1, 2, 3,..., ,,...,by deterministic pushdown automata of level .. We extend this definition to sequences of . indexed by .. We give characterisations of these sequences in terms of “higher-order” L-systems. In particular sequences of rational numbers of level 3 are characterised by polynomial recurrences (which genera作者: 放肆的你 時(shí)間: 2025-4-1 12:50
Timers and Proximities for Mobile Ambients, various resources, making them available only for a determined period of time; we add timers to ambients and capabilities. We present an example how the new model is working. The coordination of the ambients in time and space is given by assigning specific values to timers, and by a set of coordina作者: BRIEF 時(shí)間: 2025-4-1 17:42 作者: 不確定 時(shí)間: 2025-4-1 22:15 作者: Vasodilation 時(shí)間: 2025-4-2 02:19
A Fast Algorithm for Path 2-Packing Problem,. By a .-path?. we mean an undirected path such that . connects terminals from distinct sets in . and all internal nodes of?. are inner. We study the problem of finding a maximum cardinality collection?. of .-paths such that at most two paths in . pass through any node .?∈?... Our algorithm is purel作者: CALL 時(shí)間: 2025-4-2 06:12
Decidability of Parameterized Probabilistic Information Flow,system if the conditional probability of the property under some partial observation differs from the a priori probability of that property. For systems modelled as finite Markov chains we prove that the two following problems are decidable: does a system has information flow for a given regular pro作者: cliche 時(shí)間: 2025-4-2 07:39
Inverting Onto Functions and Polynomial Hierarchy,ist. Do we have evidence that such functions are hard, for example, if . is computable in polynomial-time does this imply the polynomial-time hierarchy collapses? (By computing a multivalued function in deterministic polynomial-time we mean on every input producing one of the possible values of that
