標題: Titlebook: Computer Science – Theory and Applications; 12th International C Pascal Weil Conference proceedings 2017 Springer International Publishing [打印本頁] 作者: 寓言 時間: 2025-3-21 19:36
書目名稱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é)科排名
作者: ATOPY 時間: 2025-3-21 22:44
0302-9743 cience, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing..978-3-319-58746-2978-3-319-58747-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Meditative 時間: 2025-3-22 04:08
International Economic Association Seriesally, we prove the width hierarchy for complexity classes of Boolean functions for bounded error probabilistic OBDDs. And using “reordering” method we extend a hierarchy for .-OBDD of polynomial size, for .. Moreover, we proved a similar hierarchy for bounded error probabilistic .-OBDD. And for dete作者: 與野獸博斗者 時間: 2025-3-22 07:02
https://doi.org/10.1057/9781137034298on. We define a coding of periodic patterns of generalized Dyck shifts which allows to compute their zeta function. We prove that the zeta function of a generalized Dyck shift is the commutative image of the generating function of an unambiguous context-free language and is thus an .-algebraic series.作者: 沖擊力 時間: 2025-3-22 12:17
Wei Chi,Richard Freeman,Hongbin Liarameter is the maximal length of a chain of components. Our main contribution is an exponential lower bound for this parameter. There is a simple construction for an arbitrary set of generators. However, the proof for constant alphabet is rather involved. Our results also apply to automata and their syntactic semigroups.作者: 博愛家 時間: 2025-3-22 15:15 作者: 博愛家 時間: 2025-3-22 18:37 作者: 漂浮 時間: 2025-3-22 21:13
https://doi.org/10.1057/9780230227446at is needed by the user is, in fact, of a more manageable size. In such a situation, it would be useful if one could find very fast ways of computing only the portion of the output that is required by the user.作者: 恭維 時間: 2025-3-23 01:42
Wei Chi,Richard Freeman,Hongbin Lious gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.作者: 種族被根除 時間: 2025-3-23 07:09
International Economic Association Seriesees above any of its degrees. It was however not known whether each minimal subshift’s spectrum was formed of exactly one cone or not. We construct inductively a minimal subshift whose spectrum consists of an uncountable number of cones with incomparable bases.作者: Alpha-Cells 時間: 2025-3-23 12:42 作者: 兇猛 時間: 2025-3-23 16:45
Nondeterministic Unitary OBDDs,ous gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.作者: FACT 時間: 2025-3-23 19:20
Turing Degree Spectra of Minimal Subshifts,ees above any of its degrees. It was however not known whether each minimal subshift’s spectrum was formed of exactly one cone or not. We construct inductively a minimal subshift whose spectrum consists of an uncountable number of cones with incomparable bases.作者: machination 時間: 2025-3-23 22:11
Giovanni Foresti,Stefania Trentif elements extracted so far..In this paper we show that is indeed the case. We present a version of heap that performs . in .(1) time and takes only . time to carry out the .-th extraction (where . denotes the iterated logarithm). All the above bounds are worst-case.作者: 草率女 時間: 2025-3-24 06:18
Economics and China’s Economic Rises in time ., and local updates in time ., where . is the number of intervals. We also analyze the dependence on the ply when it is not constant. Our results are adaptive: the times depend on the current ply at the time of each operation.作者: 思鄉(xiāng)病 時間: 2025-3-24 08:06
The Chinese Economy in the 1990stion. The problem is known to be NP-hard, even for uniform weights and without capacity constraints..We present a 3-approximation algorithm for the problem and 2-approximation algorithm for the unweighted variant of the problem.作者: voluble 時間: 2025-3-24 11:36 作者: Cryptic 時間: 2025-3-24 15:48 作者: 有說服力 時間: 2025-3-24 21:28
Approximation Algorithms for the Maximum Carpool Matching Problem,tion. The problem is known to be NP-hard, even for uniform weights and without capacity constraints..We present a 3-approximation algorithm for the problem and 2-approximation algorithm for the unweighted variant of the problem.作者: Pudendal-Nerve 時間: 2025-3-25 00:07 作者: Perineum 時間: 2025-3-25 04:05 作者: 侵害 時間: 2025-3-25 11:18
Saving Rates of Urban Households in China a decomposition of the string in maximal .-palindromes (i.e.?palindromes with . errors under the edit or Hamming distance) and . allowed gaps. We present an algorithm to obtain such a decomposition with the minimal total gap length in time . and space ..作者: Incompetent 時間: 2025-3-25 14:49 作者: ostrish 時間: 2025-3-25 19:35
Advances in Parameterized Verification of Population Protocols,ness: Given a population protocol, is it well specified? Given a population protocol and a predicate, does the protocol compute the predicate? Given a well-specified protocol, can we automatically obtain a symbolic representation of the predicate it computes? We survey our recent work on this problem.作者: 誓言 時間: 2025-3-25 21:22
Palindromic Decompositions with Gaps and Errors, a decomposition of the string in maximal .-palindromes (i.e.?palindromes with . errors under the edit or Hamming distance) and . allowed gaps. We present an algorithm to obtain such a decomposition with the minimal total gap length in time . and space ..作者: overbearing 時間: 2025-3-26 00:10
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n),ary input?., an alternating machine can simulate a . with . bits, representing the contents of the stack by its input head position. The standard push/pop operations are implemented by moving the head along the input.作者: 沉思的魚 時間: 2025-3-26 07:06
Generalized Dyck Shifts,on. We define a coding of periodic patterns of generalized Dyck shifts which allows to compute their zeta function. We prove that the zeta function of a generalized Dyck shift is the commutative image of the generating function of an unambiguous context-free language and is thus an .-algebraic series.作者: Dendritic-Cells 時間: 2025-3-26 10:41
,Green’s Relations in Finite Transformation Semigroups,arameter is the maximal length of a chain of components. Our main contribution is an exponential lower bound for this parameter. There is a simple construction for an arbitrary set of generators. However, the proof for constant alphabet is rather involved. Our results also apply to automata and their syntactic semigroups.作者: 相同 時間: 2025-3-26 15:24 作者: FEIGN 時間: 2025-3-26 19:24 作者: Ischemic-Stroke 時間: 2025-3-27 00:18
Advances in Parameterized Verification of Population Protocols,nd thereby change their states. Computations are infinite sequences of interactions satisfying a strong fairness constraint..A population protocol is well specified if for every initial configuration . of devices, and every computation starting at ., all devices eventually agree on a consensus value作者: colony 時間: 2025-3-27 01:22
Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs,ory, may be distributed across numerous machines, and may change over time. This has motivated a rich body of work on analyzing graphs in the data stream model and the development of general algorithmic techniques, such as graph sketching, that can help minimize the space and communication costs req作者: drusen 時間: 2025-3-27 05:32
Can We Locally Compute Sparse Connected Subgraphs?,solve optimization problems on big data, we are presented with a double catastrophe, as .. One ray of hope is that often, the portion of the output that is needed by the user is, in fact, of a more manageable size. In such a situation, it would be useful if one could find very fast ways of computing作者: irreducible 時間: 2025-3-27 11:43
Palindromic Decompositions with Gaps and Errors,iscovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient algorithms for the factorization of sequences into palindromes and maximal palindromes have been devised in recent years. We extend these studies by allowing gaps in decompositions and errors in palindromes, an作者: Morose 時間: 2025-3-27 16:51
Cascade Heap: Towards Time-Optimal Extractions, heap with an “optimal” . operation. Assuming an arbitrary linear ordering of keys, a heap with . elements typically takes . time to extract the minimum. Extracting . elements faster is impossible as this would violate the . bound for comparison-based sorting. It is known, however, that is takes onl作者: Dendritic-Cells 時間: 2025-3-27 21:43 作者: Lymphocyte 時間: 2025-3-28 01:51
,Green’s Relations in Finite Transformation Semigroups,achability in the (right/left/two-sided) Cayley graph. The equivalence classes then correspond to the strongly connected components. It is not difficult to show that, in the worst case, the number of equivalence classes is in the same order of magnitude as the number of elements. Another important p作者: 內(nèi)疚 時間: 2025-3-28 05:36 作者: 臭了生氣 時間: 2025-3-28 07:24
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n),hine using an initially delimited worktape of size .. As a consequence, the standard translation between unary languages accepted with . space and binary languages accepted with . space works for alternating machines . ...In general, if a binary language . is in ., i.e., if .?is accepted by a determ作者: 無瑕疵 時間: 2025-3-28 11:08
Turing Degree Spectra of Minimal Subshifts,erns. It has been proved by Jeandel and Vanier that the Turing degree spectra of non-periodic minimal subshifts always contain the cone of Turing degrees above any of its degrees. It was however not known whether each minimal subshift’s spectrum was formed of exactly one cone or not. We construct in作者: flex336 時間: 2025-3-28 15:33 作者: verdict 時間: 2025-3-28 21:28 作者: ethnology 時間: 2025-3-29 00:40
The Transformation Monoid of a Partially Lossy Queue,l for reliable and lossy queues, we split the alphabet of the queue into two parts: the forgettable letters and the letters that are transmitted reliably..We describe this monoid by means of a confluent and terminating semi-Thue system and then study some of the monoids algebraic properties. In part作者: 富饒 時間: 2025-3-29 06:13 作者: membrane 時間: 2025-3-29 11:09
Computer Science – Theory and Applications978-3-319-58747-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: obeisance 時間: 2025-3-29 14:50
https://doi.org/10.1007/978-981-13-7395-4ory, may be distributed across numerous machines, and may change over time. This has motivated a rich body of work on analyzing graphs in the data stream model and the development of general algorithmic techniques, such as graph sketching, that can help minimize the space and communication costs required to process these massive graphs.作者: 阻撓 時間: 2025-3-29 17:24
Pascal WeilIncludes supplementary material: 作者: 拋棄的貨物 時間: 2025-3-29 23:21 作者: amygdala 時間: 2025-3-30 02:41 作者: 強壯 時間: 2025-3-30 07:49 作者: geriatrician 時間: 2025-3-30 08:25
https://doi.org/10.1057/9780230227446solve optimization problems on big data, we are presented with a double catastrophe, as .. One ray of hope is that often, the portion of the output that is needed by the user is, in fact, of a more manageable size. In such a situation, it would be useful if one could find very fast ways of computing作者: 壯觀的游行 時間: 2025-3-30 15:41 作者: Simulate 時間: 2025-3-30 19:08 作者: Prologue 時間: 2025-3-30 21:06
https://doi.org/10.1057/9781137034298finite factors of these shifts are factors of generalized Dyck words. Generalized Dyck words were introduced by Labelle and Yeh who exhibited unambiguous algebraic grammars generating these context-free languages. Other unambiguous algebraic grammars for generalized Dyck languages were found by Duch作者: 否決 時間: 2025-3-31 02:06
Wei Chi,Richard Freeman,Hongbin Liachability in the (right/left/two-sided) Cayley graph. The equivalence classes then correspond to the strongly connected components. It is not difficult to show that, in the worst case, the number of equivalence classes is in the same order of magnitude as the number of elements. Another important p作者: 議程 時間: 2025-3-31 07:18
Wei Chi,Richard Freeman,Hongbin Lie size of strong 1-fooling sets. Then, we present classically “cheap” functions that are “expensive” for NUOBDDs and vice versa by improving the previous gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a wid作者: 哺乳動物 時間: 2025-3-31 10:06 作者: LOPE 時間: 2025-3-31 15:45 作者: Offstage 時間: 2025-3-31 21:31
International Economic Association Series maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function . from Boolean Function ., such that if for . we have gap between quantum and deterministic OB作者: 獨裁政府 時間: 2025-3-31 22:45 作者: Lipoma 時間: 2025-4-1 01:54
https://doi.org/10.1057/9781137034298l for reliable and lossy queues, we split the alphabet of the queue into two parts: the forgettable letters and the letters that are transmitted reliably..We describe this monoid by means of a confluent and terminating semi-Thue system and then study some of the monoids algebraic properties. In part作者: 一再困擾 時間: 2025-4-1 07:16 作者: Nonflammable 時間: 2025-4-1 10:32
Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs,ory, may be distributed across numerous machines, and may change over time. This has motivated a rich body of work on analyzing graphs in the data stream model and the development of general algorithmic techniques, such as graph sketching, that can help minimize the space and communication costs required to process these massive graphs.作者: 剛開始 時間: 2025-4-1 17:42 作者: colloquial 時間: 2025-4-1 19:22
978-3-319-58746-2Springer International Publishing AG 2017
