標(biāo)題: Titlebook: Adventures Between Lower Bounds and Higher Altitudes; Essays Dedicated to Hans-Joachim B?ckenhauer,Dennis Komm,Walter Unger Book 2018 Spri [打印本頁] 作者: Clique 時(shí)間: 2025-3-21 18:24
書目名稱Adventures Between Lower Bounds and Higher Altitudes影響因子(影響力)
書目名稱Adventures Between Lower Bounds and Higher Altitudes影響因子(影響力)學(xué)科排名
書目名稱Adventures Between Lower Bounds and Higher Altitudes網(wǎng)絡(luò)公開度
書目名稱Adventures Between Lower Bounds and Higher Altitudes網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Adventures Between Lower Bounds and Higher Altitudes被引頻次
書目名稱Adventures Between Lower Bounds and Higher Altitudes被引頻次學(xué)科排名
書目名稱Adventures Between Lower Bounds and Higher Altitudes年度引用
書目名稱Adventures Between Lower Bounds and Higher Altitudes年度引用學(xué)科排名
書目名稱Adventures Between Lower Bounds and Higher Altitudes讀者反饋
書目名稱Adventures Between Lower Bounds and Higher Altitudes讀者反饋學(xué)科排名
作者: Parley 時(shí)間: 2025-3-21 21:11
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexityistic finite automaton accepting this language. We show that, in spite of the fact that the difference between the size of the largest fooling set and the nondeterministic state complexity may be arbitrarily large, the fooling set lower bound methods work in many cases. We modify the method in the c作者: 配偶 時(shí)間: 2025-3-22 01:40 作者: lattice 時(shí)間: 2025-3-22 06:26
Reaction Systems, Transition Systems, and Equivalencesthe functioning of the living cell is determined by the interactions of biochemical reactions and these interactions are based on the mechanisms of facilitation and inhibition. Since their inception, reaction systems became a well-investigated novel model of computation. Following this line of resea作者: 寬容 時(shí)間: 2025-3-22 09:38 作者: Diluge 時(shí)間: 2025-3-22 14:13
Parikh Matrices: Subword Indicators and Degrees of Ambiguityperly chosen values ., for different .’s, characterize the word . completely. Certain upper triangular matrices, customarily referred to as . have turned out to be very useful for computing numbers .. This partially expository paper discusses some highlights and open problems of the theory of Parikh作者: 衰老 時(shí)間: 2025-3-22 18:45
Probabilism versus Alternation for Automataone-way alternating automata (1AFAs). We show that a 1P.FA . can be simulated by 1AFA with an at most polynomial increase in the number .(.) of states of ., provided only inputs of length at most poly(.(.)) are considered. On the other hand we gather evidence that the number of states grows super-po作者: 保守黨 時(shí)間: 2025-3-23 01:17 作者: 好開玩笑 時(shí)間: 2025-3-23 04:17 作者: 愛管閑事 時(shí)間: 2025-3-23 09:15
Sequence Hypergraphs: Paths, Flows, and Cutsypergraph is defined as a sequence of vertices (not unlike a directed path). Sequence hypergraphs are motivated by problems in public transportation networks, as they conveniently represent transportation lines. We study the complexity of several fundamental algorithmic problems, arising (not only) 作者: 喪失 時(shí)間: 2025-3-23 12:55 作者: Grasping 時(shí)間: 2025-3-23 15:58
Small Complexity Gaps for Comparison-Based Sortingchieve the first . term, so our focus is on the (negative) constant factor of the linear term. In their WADS2017 paper, Iwama and Teruyama obtained a new upper bound for this constant, which improves the existing gap by some 25%. However, since its main purpose is to have a closed formula for analys作者: duplicate 時(shí)間: 2025-3-23 21:59
Determinism and Nondeterminism in Finite Automata with Advicecognized by . with polynomial advice. We also give examples of languages that cannot be recognized by . with polynomial advice. Finally, we show that increasing advice helps for ., and for any advice of size . we show that there is a language that can be recognized by a . with advice .(.), but canno作者: ALTER 時(shí)間: 2025-3-24 00:58
Stability of Reapproximation Algorithms for the ,-Metric Traveling Salesman (Path) Problemty. Here, if one edge weight is increased, and ., . denotes the relaxation factor of the original and the modified graph, respectively, then we show how to obtain an approximation of ., which improves over existing solutions as soon as ..作者: 期滿 時(shí)間: 2025-3-24 04:10
Fully Online Matching with Advice on General Bipartite Graphs and Pathswer bounds on the amount of advice that is necessary for computing an optimal solution for paths. We complement these results by bounding the sufficient amount of advice for computing sub-optimal matchings. We furthermore prove that a single bit of advice does not help to improve over deterministic 作者: irradicable 時(shí)間: 2025-3-24 09:54 作者: 儀式 時(shí)間: 2025-3-24 11:16
Small Complexity Gaps for Comparison-Based Sortingforms for the quantity but can obtain an exact average for the number of comparisons up?to . efficiently. The major finding is that inserting one or two elements to an already sorted sequence, which is the fundamental strategy of (1,2)Insertion, is quite powerful; we conjecture that more complicated作者: Compass 時(shí)間: 2025-3-24 16:53 作者: gustation 時(shí)間: 2025-3-24 19:15 作者: hypnogram 時(shí)間: 2025-3-25 02:36
0302-9743 ithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends..978-3-319-98354-7978-3-319-98355-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 闖入 時(shí)間: 2025-3-25 05:15
https://doi.org/10.1007/BFb0041009cognized by . with polynomial advice. We also give examples of languages that cannot be recognized by . with polynomial advice. Finally, we show that increasing advice helps for ., and for any advice of size . we show that there is a language that can be recognized by a . with advice .(.), but canno作者: HAIL 時(shí)間: 2025-3-25 09:42 作者: Classify 時(shí)間: 2025-3-25 15:30
Mathematical Modeling of Mechanical Systems,wer bounds on the amount of advice that is necessary for computing an optimal solution for paths. We complement these results by bounding the sufficient amount of advice for computing sub-optimal matchings. We furthermore prove that a single bit of advice does not help to improve over deterministic 作者: Instinctive 時(shí)間: 2025-3-25 19:50 作者: oracle 時(shí)間: 2025-3-25 21:31
Scalar Systems: An Introduction,forms for the quantity but can obtain an exact average for the number of comparisons up?to . efficiently. The major finding is that inserting one or two elements to an already sorted sequence, which is the fundamental strategy of (1,2)Insertion, is quite powerful; we conjecture that more complicated作者: Synchronism 時(shí)間: 2025-3-26 00:55
0302-9743 Hromkovic’s research topics.This Festschrift volume is published in honor of Juraj Hromkovi? on the occasion of his 60th birthday. Juraj Hromkovi? is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education..The contributions in th作者: Palate 時(shí)間: 2025-3-26 05:40
Frequency domain exact model matching, the nondeterministic state complexity may be arbitrarily large, the fooling set lower bound methods work in many cases. We modify the method in the case when multiple initial states may save one state. We also state some useful properties that allow us to avoid describing particular fooling sets which may often be difficult and tedious.作者: 值得贊賞 時(shí)間: 2025-3-26 10:41
https://doi.org/10.1007/BFb0041009esent new results in the nondeterministic finite automata setting. We characterise some subfamilies of regular languages that are nondeterministically decomposable/undecomposable and exhibit an infinite sequence of regular languages that are nondeterministically undecomposable but decomposable in the deterministic finite automata setting.作者: GUEER 時(shí)間: 2025-3-26 13:38 作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-26 17:07
Time domain exact model matching, of ., provided only inputs of length at most poly(.(.)) are considered. On the other hand we gather evidence that the number of states grows super-polynomially if the number of alternations is bounded by a fixed constant. Thus the behavior of one-way automata seems to be in marked contrast with the behavior of polynomial-time computations.作者: 贊美者 時(shí)間: 2025-3-27 00:48
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity the nondeterministic state complexity may be arbitrarily large, the fooling set lower bound methods work in many cases. We modify the method in the case when multiple initial states may save one state. We also state some useful properties that allow us to avoid describing particular fooling sets which may often be difficult and tedious.作者: mosque 時(shí)間: 2025-3-27 04:29 作者: Bouquet 時(shí)間: 2025-3-27 09:18 作者: thrombosis 時(shí)間: 2025-3-27 10:51
Probabilism versus Alternation for Automata of ., provided only inputs of length at most poly(.(.)) are considered. On the other hand we gather evidence that the number of states grows super-polynomially if the number of alternations is bounded by a fixed constant. Thus the behavior of one-way automata seems to be in marked contrast with the behavior of polynomial-time computations.作者: periodontitis 時(shí)間: 2025-3-27 13:40 作者: 輕快走過 時(shí)間: 2025-3-27 18:59 作者: CROAK 時(shí)間: 2025-3-28 00:40
Multivariable adaptive control,lish a new bridge between reaction systems and transition systems. In order to define equivalences which capture various ways of interacting with an environment, we also introduce models of the environment which evolve in a finite-state fashion.作者: elucidate 時(shí)間: 2025-3-28 03:05 作者: rectocele 時(shí)間: 2025-3-28 08:34 作者: 小卒 時(shí)間: 2025-3-28 13:49 作者: 侵略主義 時(shí)間: 2025-3-28 18:20
Adventures Between Lower Bounds and Higher Altitudes978-3-319-98355-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Figate 時(shí)間: 2025-3-28 18:57 作者: corpuscle 時(shí)間: 2025-3-29 00:44
https://doi.org/10.1007/BFb0041009romes, that cannot be recognized by . regardless of the size of advice. Also, we show that a . cannot utilize more than exponential advice. We initiate the study of . with advice: we show that, unlike the ., . can recognize all languages with advice of exponential size. On the other side of the spec作者: Nonthreatening 時(shí)間: 2025-3-29 03:21
Frequency domain exact model matching,istic finite automaton accepting this language. We show that, in spite of the fact that the difference between the size of the largest fooling set and the nondeterministic state complexity may be arbitrarily large, the fooling set lower bound methods work in many cases. We modify the method in the c作者: 清醒 時(shí)間: 2025-3-29 08:49
Time domain exact model matching,same as for .. In this note we continue the analysis of .-Abelian equivalence classes. In particular, we show that, for any fixed integer ., the language of words representing equivalence classes of cardinality . is regular.作者: 中子 時(shí)間: 2025-3-29 14:21 作者: FLIP 時(shí)間: 2025-3-29 18:52
https://doi.org/10.1007/BFb0041009tion, especially its usefulness, i.e., its ability to simplify a solution of a problem. We formalize the problem via decompositions of automata and present new results in the nondeterministic finite automata setting. We characterise some subfamilies of regular languages that are nondeterministically作者: Champion 時(shí)間: 2025-3-29 20:10 作者: Diatribe 時(shí)間: 2025-3-30 00:33 作者: Synchronism 時(shí)間: 2025-3-30 05:30
Clinical Application: Multiple Sclerosis, the . triangle inequality (i.e., for some . ., we have that .), and given a vertex . whose removal from . (resp., addition to .), along with all its incident edges, produces a new weighted graph still obeying the strengthened triangle inequality, find a minimum-cost Hamiltonian cycle of the modifie作者: 有其法作用 時(shí)間: 2025-3-30 11:38 作者: prodrome 時(shí)間: 2025-3-30 16:04
Design of Control Systems in State Space,ypergraph is defined as a sequence of vertices (not unlike a directed path). Sequence hypergraphs are motivated by problems in public transportation networks, as they conveniently represent transportation lines. We study the complexity of several fundamental algorithmic problems, arising (not only) 作者: 壓迫 時(shí)間: 2025-3-30 20:33 作者: 啜泣 時(shí)間: 2025-3-30 23:50 作者: Arable 時(shí)間: 2025-3-31 01:12 作者: 反抗者 時(shí)間: 2025-3-31 07:54 作者: ascetic 時(shí)間: 2025-3-31 11:57 作者: ligature 時(shí)間: 2025-3-31 16:52 作者: Accrue 時(shí)間: 2025-3-31 18:15
Multivariable adaptive control,For all?., the problem of . for height?. and length?. captures the task of simulating . with .?states on inputs with .?symbols. We prove that the number of states in a smallest . which decides this problem is?., if .; and ., if ..
