標(biāo)題: Titlebook: Computer Science – Theory and Applications; 11th International C Alexander S. Kulikov,Gerhard J. Woeginger Conference proceedings 2016 Spri [打印本頁] 作者: 撒謊 時間: 2025-3-21 19:16
書目名稱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é)科排名
作者: PACK 時間: 2025-3-21 22:50
978-3-319-34170-5Springer International Publishing Switzerland 2016作者: Peristalsis 時間: 2025-3-22 04:24 作者: 抗體 時間: 2025-3-22 06:22 作者: 尖 時間: 2025-3-22 09:48 作者: 溫順 時間: 2025-3-22 16:28
David E. Hobart,Joseph R. PetersonAn arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over . where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression.作者: 溫順 時間: 2025-3-22 20:11 作者: Throttle 時間: 2025-3-22 23:50 作者: 單挑 時間: 2025-3-23 01:45 作者: Coterminous 時間: 2025-3-23 08:27
The Chemistry of Superheavy Elementsive a partial algorithm that decides, given .,?., whether an Engel identity is satisfied. It succeeds, importantly, in proving that Grigorchuk’s 2-group is not Engel..We consider next the problem of recognizing Engel elements, namely elements . such that the map . attracts to .. Although this proble作者: Melanoma 時間: 2025-3-23 11:50
Andreas Türler,Kenneth E. Gregorichof Boolean relations as input, we seek a satisfying assignment of the formula having minimal Hamming distance to a given assignment that is not required to be a model (NearestSolution, NSol). We obtain a complete classification with respect to the relations admitted in the formula. For two classes o作者: 衍生 時間: 2025-3-23 14:40
Synthesis of Superheavy Elements,dify at most?. edges in?. so that the resulting graph contains no induced subgraph isomorphic to?.? In our variant, the input additionally contains a vertex-disjoint packing?. of induced subgraphs of?., which provides a lower bound?. on the number of edge modifications required to transform?. into a作者: 不能逃避 時間: 2025-3-23 20:29 作者: 精確 時間: 2025-3-23 23:24
William J. Chamberlain,R. L. Stedmanstraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity. Mean Payoff Games are known to be in?., which is not known for max-closed semilinear constraints. Semilinear relations that are max-closed and additionally closed under 作者: TRACE 時間: 2025-3-24 03:58 作者: 品牌 時間: 2025-3-24 08:21
N. I. Ilchenko,Yu. I. Pyatnitskyitional approach to the design of stochastic systems with hard real-time constraints. This paper achieves the first step towards that goal. Firstly, we define a parallel composition operator that (we prove) corresponds to the interleaving semantics for that model; we give conditions over probability作者: 饑荒 時間: 2025-3-24 11:24 作者: 種類 時間: 2025-3-24 15:33 作者: 陳腐思想 時間: 2025-3-24 19:03 作者: Jargon 時間: 2025-3-25 01:06
P. Gary Eller,Robert A. Penneman at most . vertex or edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by . for any combination of the allowed editing operations. From the positive side, we show that the problem can be solved in time . for .-vertex graphs, where ., i.e., the problem is FPT作者: 永久 時間: 2025-3-25 03:31 作者: 無能力之人 時間: 2025-3-25 07:38
https://doi.org/10.1007/978-94-009-3155-8ives a value of another random variable . that is jointly distributed with .. Alice’s goal is to transmit . to Bob (with some error probability .). Instead of one-way transmission we allow them to interact. They may also use shared randomness..We show, that for every natural . Alice can transmit . t作者: commonsense 時間: 2025-3-25 12:18
Wolfgang H. Runde,Wallace W. Schulzent of first-order logic over infinite words; the membership problem asks for a given language whether it is definable in some fixed fragment. The alphabetic topology was introduced as part of an effective characterization of the fragment?. over infinite words. Here, . consists of the first-order fo作者: Amplify 時間: 2025-3-25 18:06
Harold W. Kirby,Lester R. Morss finite monoids: the Trotter-Weil Hierarchy. The various ways of climbing up this hierarchy include Mal’cev products, deterministic and co-deterministic concatenation as well as identities of .-terms. We show that the word problem for .-terms over each level of the Trotter-Weil Hierarchy is decidabl作者: affinity 時間: 2025-3-25 23:09 作者: 智力高 時間: 2025-3-26 01:01 作者: anticipate 時間: 2025-3-26 06:28 作者: 一大群 時間: 2025-3-26 10:07 作者: arousal 時間: 2025-3-26 14:57 作者: Anemia 時間: 2025-3-26 19:51 作者: Project 時間: 2025-3-26 22:41
0302-9743 2016, held in St. Petersburg, Russia, in June 2016.. .The 28 full papers presented in this volume were carefully reviewed and selected from 71 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: incl作者: Virtues 時間: 2025-3-27 01:47
Wolfgang Ohse,Georg Matthess,Asaf Pekdegerrespectively) with respect to three basic language recognition modes. We show that, in the cases of bounded and unbounded error, AfAs are more powerful than QFAs and PFAs, and, in the case of nondeterministic computation, AfAs are more powerful than PFAs but equivalent to QFAs.作者: 鎮(zhèn)壓 時間: 2025-3-27 09:17 作者: nephritis 時間: 2025-3-27 11:16
Conference proceedings 2016nguages and automata; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods..作者: 銼屑 時間: 2025-3-27 15:49
https://doi.org/10.1007/978-3-642-51024-3f correctness and enable the designer to specify quality, and continue to the quality measure of sensing: the detail in which the inputs should be read in order to generate a correct computation. The first part is based on the articles [.–.]. The second part is based on [., .].作者: Lamina 時間: 2025-3-27 20:37 作者: Alopecia-Areata 時間: 2025-3-27 22:38 作者: hurricane 時間: 2025-3-28 05:20
R. Rodriguez-Clemente,A. Hidalgo-Lopezsual advantage of being able to exploit that it knows the sequence is continuing beyond the current request. Through a collection of online problems, including machine scheduling, bin packing, dual bin packing, and seat reservation, we investigate the significance of this particular offline advantage.作者: demote 時間: 2025-3-28 09:55
Introduction to Zirconacycle Chemistry,ver, it will be shown that the single tree computed is no larger than twice the optimum for (not necessarily connected) 2-EDS, thus also approximating 2-EDS equally well. It also implies that 2-EDS with clustering properties can be approximated within 2 as well.作者: Catheter 時間: 2025-3-28 10:48 作者: 責(zé)怪 時間: 2025-3-28 15:11
Parameterizing Edge Modification Problems Above Lower Bounds,cking?. contains subgraphs with bounded solution size. For?., we also prove NP-hardness in case of edge-disjoint packings of?.s and?., while for . and ., NP-hardness for?. even holds for vertex-disjoint packings of?.s.作者: 易達(dá)到 時間: 2025-3-28 19:26 作者: 草率男 時間: 2025-3-29 01:16 作者: Tracheotomy 時間: 2025-3-29 05:22 作者: ear-canal 時間: 2025-3-29 07:53
https://doi.org/10.1007/978-3-642-51024-3te complexity is polynomially related to sensitivity. Previously, it has been shown that .. In this work, we give a better upper bound of . using a recent theorem limiting the structure of function graphs. We also examine relations between these measures for functions with 1-sensitivity . and arbitrary 0-sensitivity ..作者: 尋找 時間: 2025-3-29 12:46
The Chemistry of Superheavy Elementsm seems intractable in general, we prove that it is decidable for Grigorchuk’s group: Engel elements are precisely those of order at most 2..Our computations were implemented using the package . within the computer algebra system ..作者: 楓樹 時間: 2025-3-29 17:19 作者: 厚顏無恥 時間: 2025-3-29 21:55 作者: 值得贊賞 時間: 2025-3-30 01:41
P. Gary Eller,Robert A. Penneman when parameterized by .. We also show that . has a polynomial kernel when parameterized by . if only edge additions are allowed, and there is no polynomial kernel unless . for all other combinations of allowed editing operations.作者: 興奮過度 時間: 2025-3-30 06:19 作者: 定點 時間: 2025-3-30 09:52
Wolfgang H. Runde,Wallace W. Schulzterization of the Boolean closure of the alphabetic topology, that is, given an .-regular language ., it is decidable whether . is a Boolean combination of open sets in the alphabetic topology. This is then used for transferring Place and Zeitoun’s recent decidability result for . from finite to infinite words.作者: 爭論 時間: 2025-3-30 14:23
Level Two of the Quantifier Alternation Hierarchy over Infinite Words,terization of the Boolean closure of the alphabetic topology, that is, given an .-regular language ., it is decidable whether . is a Boolean combination of open sets in the alphabetic topology. This is then used for transferring Place and Zeitoun’s recent decidability result for . from finite to infinite words.作者: Vulnerable 時間: 2025-3-30 16:42
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing,sing times is solvable in .?time, that is, fixed-parameter tractable parameterized by?.. Various upper bounds shown using the schedule completion theorem suggest it to be likewise beneficial for the development of approximation algorithms.作者: BLUSH 時間: 2025-3-30 23:12
Max-Closed Semilinear Constraint Satisfaction,ically restricted first-order logic, and another characterization in terms of a finite set of relations . that allow primitive positive definitions of all other relations in the class. We also present a subclass of max-closed constraints where the CSP is in .; this class generalizes the class of max作者: 經(jīng)典 時間: 2025-3-31 02:33
Subclasses of Baxter Permutations Based on Pattern Avoidance,nd on growth rate, and a linear time algorithm for deciding membership in each subclass. Based on the recurrence relation describing the class, we also give a polynomial time algorithm for enumeration. We finally prove that Baxter permutations are closed under inverse based on an argument inspired f作者: FACT 時間: 2025-3-31 07:24 作者: 要控制 時間: 2025-3-31 11:25
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy, language variety?. in the Trotter-Weil Hierarchy and every language variety . given by an identity of .-terms, one can decide whether .. This includes the case where . is some level of the . quantifier alternation hierarchy. As an application of our results, we show that the separation problems for作者: RACE 時間: 2025-3-31 14:56
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory, which established .-completeness of a related polynomial but under constant-depth oracle circuit reductions. Both polynomials are based on graph homomorphisms. A simple restriction yields a family similarly complete for ..作者: 尖叫 時間: 2025-3-31 19:54
0302-9743 networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods..978-3-319-34170-5978-3-319-34171-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Thyroxine 時間: 2025-3-31 23:58 作者: muffler 時間: 2025-4-1 03:56
William J. Chamberlain,R. L. Stedmanically restricted first-order logic, and another characterization in terms of a finite set of relations . that allow primitive positive definitions of all other relations in the class. We also present a subclass of max-closed constraints where the CSP is in .; this class generalizes the class of max作者: GUEER 時間: 2025-4-1 08:18
P. Gary Eller,Robert A. Pennemannd on growth rate, and a linear time algorithm for deciding membership in each subclass. Based on the recurrence relation describing the class, we also give a polynomial time algorithm for enumeration. We finally prove that Baxter permutations are closed under inverse based on an argument inspired f作者: 野蠻 時間: 2025-4-1 12:32 作者: anatomical 時間: 2025-4-1 14:19
