Titlebook: Adventures Between Lower Bounds and Higher Altitudes; Essays Dedicated to Hans-Joachim Böckenhauer,Dennis Komm,Walter Unger Book 2018 Spri

Clique

书目名称Adventures Between Lower Bounds and Higher Altitudes影响因子(影响力)




书目名称Adventures Between Lower Bounds and Higher Altitudes影响因子(影响力)学科排名




书目名称Adventures Between Lower Bounds and Higher Altitudes网络公开度




书目名称Adventures Between Lower Bounds and Higher Altitudes网络公开度学科排名




书目名称Adventures Between Lower Bounds and Higher Altitudes被引频次




书目名称Adventures Between Lower Bounds and Higher Altitudes被引频次学科排名




书目名称Adventures Between Lower Bounds and Higher Altitudes年度引用




书目名称Adventures Between Lower Bounds and Higher Altitudes年度引用学科排名




书目名称Adventures Between Lower Bounds and Higher Altitudes读者反馈




书目名称Adventures Between Lower Bounds and Higher Altitudes读者反馈学科排名

Parley

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

配偶

lattice

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

宽容

Diluge

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

衰老

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

保守党

好开玩笑

爱管闲事

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)