標(biāo)題: Titlebook: Computer Science - Theory and Applications; 9th International Co Edward A. Hirsch,Sergei O. Kuznetsov,Nikolay K. Ve Conference proceedings [打印本頁] 作者: Adentitious 時間: 2025-3-21 18:17
書目名稱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é)科排名
作者: 貪婪地吃 時間: 2025-3-21 23:31 作者: 聯(lián)合 時間: 2025-3-22 03:22
Computer Science - Theory and Applications978-3-319-06686-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: KIN 時間: 2025-3-22 08:13
https://doi.org/10.1007/978-1-4615-0179-4 finite groups. We also introduce and study a generalization of linear circuits in which the goal is to compute . where . is a vector of indeterminates and . is a matrix whose entries come from . rings. We show some lower bounds in this setting as well.作者: wall-stress 時間: 2025-3-22 08:45
Ricardo Gottschalk,Cecilia Azevedo Sodrébout .) are needed to guess an element .?∈?{0,1}. such that .?∈?. with probability >?1/2? Motivated by questions in complexity theory, we prove tight lower bounds with respect to a few different classes of queries:作者: artless 時間: 2025-3-22 13:25 作者: artless 時間: 2025-3-22 19:52
Masahiko Inase,Sharleen T. Sakai,Jun Tanji equations in free groups and monoids with involution in the presence of rational constraints. This became possible due to the recently invented recompression technique of the second author..He successfully applied the recompression technique for pure word equations without involution or rational co作者: 遠地點 時間: 2025-3-22 22:47
Toshihiko Aosaki,Yasuo Kawaguchilgorithmic results obtained by similar techniques and thus exhibit the core of these techniques. The classes of problems are typically defined in terms of logic and structural graph theory. A well-known example of an algorithmic meta theorem is Courcelle’s Theorem, stating that all properties of gra作者: insidious 時間: 2025-3-23 04:49 作者: Stable-Angina 時間: 2025-3-23 06:55 作者: Isolate 時間: 2025-3-23 10:53 作者: AV-node 時間: 2025-3-23 17:45 作者: Schlemms-Canal 時間: 2025-3-23 21:25
Henry J. Waldvogel,Richard L. M. Faull(low) degree. Here, . is a finite field. The problem is studied in the framework of real number complexity as introduced by Blum, Shub, and Smale. Our main result is at least of a twofold interest. First, it provides one of two major lacking ingredients for proving a real PCP theorem along the lines作者: Fulminate 時間: 2025-3-24 02:14
https://doi.org/10.1007/978-1-4615-0715-4f testing properties of linear and quadratic functions can be characterized in terms of complexity in another model of computation called ...The observation allows us to characterize testable properties of linear functions in terms of the approximate .. norm of the Fourier spectrum of an associated 作者: 饒舌的人 時間: 2025-3-24 05:56
Joshua A. Goldberg,Hagai Bergman The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques)..Hüffner et al.?[LATIN 2008, Theory Comput. Syst. 2010] initiated the parameterized study of ., where the allowed modification is vertex deletion, and presented 作者: DENT 時間: 2025-3-24 10:08
Joshua A. Goldberg,Hagai Bergmannumber of quantified variables is unbounded and the satisfiability problem is .-complete for the propositional fragment. We show that the satisfiability problem for 1SL1 is .-complete and we characterize its expressive power by showing that every formula is equivalent to a Boolean combination of ato作者: Schlemms-Canal 時間: 2025-3-24 13:54 作者: 厭倦嗎你 時間: 2025-3-24 16:35
https://doi.org/10.1007/0-387-28066-9uced. We combine these variants and introduce the local adjacency metric dimension. We show that the (local) metric dimension of the corona product of a graph of order . and some non-trivial graph . equals . times the (local) adjacency metric dimension of?.. This strong relation also enables us to i作者: follicle 時間: 2025-3-24 20:26 作者: Brain-Imaging 時間: 2025-3-25 01:41 作者: 做事過頭 時間: 2025-3-25 04:02
The Basalt Fiber—Material Design Arter problems. We consider three computation problems on strings and show how the polyadic modal .-calculus can define their solutions. We use partial evaluation on a model checking algorithm in order to obtain an efficient algorithm for the longest common substring problem. It shows good performance 作者: STERN 時間: 2025-3-25 11:15
https://doi.org/10.1057/9780230276093the derived relations and structures are automatic when all but one input are filled with constants. One can also permit that this applies to equality in the structure so that only the sets of representatives equal to a given element of the structure are regular while equality itself is not an autom作者: defile 時間: 2025-3-25 14:16 作者: Curmudgeon 時間: 2025-3-25 15:50
Possibilities of Estimating Exposures,the corresponding soundness and completeness results. Primal implication .?→?.. corresponds to the encryption of . with a secret key ., primal disjunction .?∨?.. is a group key and . reflects some backdoor constructions such as full superuser permissions or a universal decryption key. For the logic 作者: Vertebra 時間: 2025-3-25 23:11
Statistical Approaches to PD Validation,rdered decision diagrams, where the terminal nodes are labeled with arbitrary elements of a semiring (instead of 0 and 1). A simple example shows that the product of two MTDD-represented matrices cannot be represented by an MTDD of polynomial size. To overcome this deficiency, we extended MTDDs to M作者: 信徒 時間: 2025-3-26 03:18
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains, finite groups. We also introduce and study a generalization of linear circuits in which the goal is to compute . where . is a vector of indeterminates and . is a matrix whose entries come from . rings. We show some lower bounds in this setting as well.作者: faddish 時間: 2025-3-26 06:15 作者: 粗野 時間: 2025-3-26 11:36 作者: alabaster 時間: 2025-3-26 13:39
Masahiko Inase,Sharleen T. Sakai,Jun Tanjiuations is in PSPACE (Plandowski 1999) and the corresponding result for equations in free groups with rational constraints (Diekert, Hagenah and Gutiérrez 2001). As a byproduct we obtain a?direct proof that it is decidable in PSPACE whether or not the solution set is finite.作者: ascend 時間: 2025-3-26 19:57 作者: 敵手 時間: 2025-3-26 23:56
https://doi.org/10.1007/978-1-4615-0715-4is unlikely to give anything better than Ω(.) as a lower bound..In the case of quadratic functions, we prove an adaptive two-sided Ω(..) lower bound for testing affine isomorphism to the inner product function. We remark that this bound is tight and furnishes an example of a function for which the t作者: 不斷的變動 時間: 2025-3-27 03:14
The Basalt Fiber—Material Design Art we give .-terms?.. and?.. such that an?FO.-definable language is in . if and only if its ordered syntactic monoid satisfies the identity ..?≤?... Among other techniques, the proof relies on an extension of block products to ordered monoids.作者: Obedient 時間: 2025-3-27 09:18
Edward A. Hirsch,Sergei O. Kuznetsov,Nikolay K. Ve作者: Generic-Drug 時間: 2025-3-27 13:30
Finding All Solutions of Equations in Free Groups and Monoids with Involution,uations is in PSPACE (Plandowski 1999) and the corresponding result for equations in free groups with rational constraints (Diekert, Hagenah and Gutiérrez 2001). As a byproduct we obtain a?direct proof that it is decidable in PSPACE whether or not the solution set is finite.作者: 發(fā)酵 時間: 2025-3-27 14:54 作者: 警告 時間: 2025-3-27 21:41 作者: 枯燥 時間: 2025-3-27 23:20
Block Products and Nesting Negations in FO2, we give .-terms?.. and?.. such that an?FO.-definable language is in . if and only if its ordered syntactic monoid satisfies the identity ..?≤?... Among other techniques, the proof relies on an extension of block products to ordered monoids.作者: 變態(tài) 時間: 2025-3-28 03:31
https://doi.org/10.1007/0-387-28066-9king . as a base case for ., we establish an efficient internal sorting algorithm calling for at most . log.???1.3999.?+?.(.) comparisons on average. . with constant size base cases shows the best performance on practical inputs and is competitive to STL-..作者: nonchalance 時間: 2025-3-28 09:39 作者: clarify 時間: 2025-3-28 13:28
Statistical Approaches to PD Validation, whether the determinant of a MTDD-represented matrix vanishes is .-complete, and the same problem is .-complete for MTDD.-represented diagonal matrices. Computing a specific entry in a product of MTDD-represented matrices is #.-complete. Complete proofs can be found in the full version [19] of this paper.作者: 沉著 時間: 2025-3-28 14:37
,QuickXsort: Efficient Sorting with , log,???1.399,?+?,(,) Comparisons on Average,king . as a base case for ., we establish an efficient internal sorting algorithm calling for at most . log.???1.3999.?+?.(.) comparisons on average. . with constant size base cases shows the best performance on practical inputs and is competitive to STL-..作者: Incise 時間: 2025-3-28 21:28 作者: 津貼 時間: 2025-3-29 02:40 作者: GLEAN 時間: 2025-3-29 04:39
0302-9743 ne 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 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 in theoretical computer science and its applications.978-3作者: 紡織品 時間: 2025-3-29 09:23
Toshihiko Aosaki,Yasuo Kawaguchis of logic and structural graph theory. A well-known example of an algorithmic meta theorem is Courcelle’s Theorem, stating that all properties of graphs of bounded tree width that are definable in monadic second-order logic are decidable in linear time..This paper is a brief and nontechnical survey of the most important algorithmic meta theorems.作者: Peak-Bone-Mass 時間: 2025-3-29 13:25
Chihiro Ohye,Minoru Kimura,John S. McKenzieguments width. The infinite lattice of definability for integers with a successor function (a non .-categorical structure) is described. Methods of investigation include study of automorphism groups of elementary extensions of structures under consideration, using Svenonius theorem and a generalization of it.作者: 取消 時間: 2025-3-29 18:34 作者: 饑荒 時間: 2025-3-29 23:30
https://doi.org/10.1007/0-387-28066-9 a graph of order . and some non-trivial graph . equals . times the (local) adjacency metric dimension of?.. This strong relation also enables us to infer computational hardness results for computing the (local) metric dimension, based on according hardness results for (local) adjacency metric dimension that we also give.作者: LUMEN 時間: 2025-3-30 03:42
The Basalt Fiber—Material Design Arte the multiplicative complexity within a factor of (2???.).. When given a circuit, the problem of determining the multiplicative complexity is in the second level of the polynomial hierarchy. For nonlinearity, we show that it is #. hard to compute given a function represented by a circuit.作者: Gudgeon 時間: 2025-3-30 04:28 作者: 奴才 時間: 2025-3-30 10:27 作者: 松馳 時間: 2025-3-30 13:29 作者: placebo-effect 時間: 2025-3-30 16:56
Testing Low Degree Trigonometric Polynomials, main result is at least of a twofold interest. First, it provides one of two major lacking ingredients for proving a real PCP theorem along the lines of the proof of the original PCP theorem in the Turing model. Secondly, beside the PCP framework it adds to the still small list of properties that can be tested in the BSS model over ?.作者: 貝雷帽 時間: 2025-3-30 23:54
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results, a graph of order . and some non-trivial graph . equals . times the (local) adjacency metric dimension of?.. This strong relation also enables us to infer computational hardness results for computing the (local) metric dimension, based on according hardness results for (local) adjacency metric dimension that we also give.作者: Ingratiate 時間: 2025-3-31 04:17 作者: 作繭自縛 時間: 2025-3-31 07:05 作者: 夾死提手勢 時間: 2025-3-31 12:15 作者: 主講人 時間: 2025-3-31 16:40
0302-9743 lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.978-3-319-06685-1978-3-319-06686-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: SPURN 時間: 2025-3-31 19:09
Possibilities of Estimating Exposures,of . as a universal key (it was never considered before) we prove that the derivability problem has linear time complexity. We also show that the universal key can be emulated using primal disjunction.作者: obviate 時間: 2025-4-1 01:44
Primal Implication as Encryption,of . as a universal key (it was never considered before) we prove that the derivability problem has linear time complexity. We also show that the universal key can be emulated using primal disjunction.作者: 鉆孔 時間: 2025-4-1 02:15 作者: Jocose 時間: 2025-4-1 07:30
Joshua A. Goldberg,Hagai Bergmanthm for . and, thanks to its simplicity, became one of the textbook examples of an application of the iterative compression principle. In our work we break the 2.-barrier for . and present an .-time branching algorithm.作者: 使成核 時間: 2025-4-1 10:14
Joshua A. Goldberg,Hagai Bergmanf programs with singly-linked lists. When the number of program variables is fixed, the complexity drops to polynomial time. All the fragments we consider contain the magic wand operator and first-order quantification over a single variable.
