Titlebook: Mathematical Foundations of Computer Science 2005; 30th International S Joanna Jȩdrzejowicz,Andrzej Szepietowski Conference proceedings 200

arouse

书目名称Mathematical Foundations of Computer Science 2005影响因子(影响力)




书目名称Mathematical Foundations of Computer Science 2005影响因子(影响力)学科排名




书目名称Mathematical Foundations of Computer Science 2005网络公开度




书目名称Mathematical Foundations of Computer Science 2005网络公开度学科排名




书目名称Mathematical Foundations of Computer Science 2005被引频次




书目名称Mathematical Foundations of Computer Science 2005被引频次学科排名




书目名称Mathematical Foundations of Computer Science 2005年度引用




书目名称Mathematical Foundations of Computer Science 2005年度引用学科排名




书目名称Mathematical Foundations of Computer Science 2005读者反馈




书目名称Mathematical Foundations of Computer Science 2005读者反馈学科排名

得罪人

The Complexity of Satisfiability Problems: Refining Schaefer’s Theoreme isomorphism (and these isomorphism types are distinct if and only if P ≠ NP). We show that if one considers AC. isomorphisms, then there are exactly six isomorphism types (assuming that the complexity classes NP, P, ⊕L, NL, and L are all distinct).

cardiovascular

Negligible

Some Computational Issues in Membrane Computingnology) gives way to a practical bio-realization (or chip realization). Here we report on recent results that answer some interesting and fundamental open questions in the field. These concern computational issues such as determinism versus nondeterminism, membrane and alphabet-size hierarchies, and various notions of parallelism.

Amenable

Pure Nash Equilibria in Games with a Large Number of Actionsers is large and the number of strategies for each player is constant, while the problem is Σ.-complete when the number of players is a constant and the size of the sets of strategies is exponential (with respect to the length of the strategies).

准则

被告

Regular Sets of Higher-Order Pushdown Stacksact, this notion of regularity coincides with the notion of monadic second order definability over the canonical structure associated to level . stacks. Finally, we consider the link between regular sets of stacks and families of infinite graphs defined by higher-order pushdown systems.

Microgram

On the Communication Complexity of Co-linearity Problemsove that the above bound is tight in the ., in which all the transmitted message bits are linear functions of the input bits. We also discuss ..’s quantum communication complexity, which also has received considerable attention in recent years.

Expiration

Adversarial Queueing Model for Continuous Network Dynamicsully loaded. Concerning packet scheduling protocols, we show that the well-known ., .,. and . protocols remain universally stable in our model. We also show that the . model is strictly stronger than the . model by presenting scheduling policies that are unstable under the former while they are universally stable under the latter.

metropolitan

Linearly Bounded Infinite Graphsriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another family of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-family of linearly bounded graphs.