Mathematical Foundations of Computer Science 1995 : 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings. 1st ed. 1995

種類:

電子ブック

責任表示:

edited by Jiri Wiedermann, Petr Hajek

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1995

著者名:

• Wiedermann, Jiri.
• Hajek, Petr.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 969

ISBN:

9783540447689 [3540447687]    

注記:

Scheduling parallel communication: The h-relation problem -- Decomposable structures, Boolean function representations, and optimization -- The complexity of interval routing on random graphs -- Bridging across the log(n) space frontier -- Second order logic and the weak exponential hierarchies -- On the computing paradigm and computational complexity -- Ranked structures in nonmonotonic reasoning and belief revision: Abstract -- Symbolic dynamics and finite automata -- Lower bounds for propositional proofs and independence results in bounded arithmetic (abstract) -- Physics and the new computation -- Measure on P: Robustness of the notion -- Comparing counting classes for logspace, one-way logspace, and first-order -- Automata that take advice -- Nonuniform lower bounds for exponential time classes -- On a quantitative notion of uniformity -- Separations by random oracles and “Almost” classes for generalized reducibilities -- On the complexity of finite memory policies for Markov decision processes -- Derand
This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.

ローカル注記:

学内専用E-BOOKS (local access only)