Mathematical Foundations of Computer Science 1995: 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings (Lecture Notes in Computer Science) - Livres de poche

EAN (ISBN-13): 9783540602460
ISBN (ISBN-10): 3540602461
Version reliée
Livre de poche
Date de parution: 1995
Editeur: Springer Berlin Heidelberg
612 Pages
Poids: 0,912 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-04-04T10:53:18+02:00 (Zurich)
Page de détail modifiée en dernier sur 2023-12-02T15:34:45+01:00 (Zurich)
ISBN/EAN: 9783540602460

ISBN - Autres types d'écriture:
3-540-60246-1, 978-3-540-60246-0
Autres types d'écriture et termes associés:
Auteur du livre: wiedermann, petr, jiri hajek, andrzej just
Titre du livre: mfc, czech republic, 1995 band, republic com, mathematical foundations computer science, the mathematical foundations, august 1995, international proceedings, mfcs

---

Données de l'éditeur

Auteur: Jiri Wiedermann; Petr Hajek
Titre: Lecture Notes in Computer Science; Mathematical Foundations of Computer Science 1995 - 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings
Editeur: Springer; Springer Berlin
594 Pages
Date de parution: 1995-08-16
Berlin; Heidelberg; DE
Langue: Anglais
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIII, 594 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; complexity; complexity theory; formal language; model checking; semantics; algorithm analysis and problem complexity; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Compilers and Interpreters; Algorithmen und Datenstrukturen; Compiler und Übersetzer; EA

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.- Derandomization for sparse approximations and independent sets.- Asymptotically efficient in-place merging.- The complexity of the falsifiability problem for pure implicational formulas.- Strong lower bounds on the approximability of some NPO PB-complete maximization problems.- Some typical properties of large AND/OR Boolean formulas.- The hedge: An efficient storage device for Turing machines with one head.- Graph inference from a walk for trees of bounded degree 3 is NP-complete.- Honeycomb networks.- Witness-isomorphic reductions and the local search problem (extended abstract).- Multiple product modulo arbitrary numbers.- Lower bounds for the majority communication complexity of various graph accessibility problems.- Strong optimal lower bounds for Turing machines that acceptnonregular languages.- A superpolynomial lower bound for (1,+k(n))-branching programs.- Deterministic parsing for augmented context-free grammars.- A periodicity theorem on words and applications.- A new approach to analyse Coupled-Context-Free languages.- Computational complexity of simultaneous elementary matching problems.- Graph reducibility of term rewriting systems.- Positive recursive type assignment.- String recognition on anonymous rings.- The firing squad synchronization problem on Cayley graphs.- Solving cheap graph problems on Meshes.- An elementary bisimulation decision procedure for arbitrary context-free processes.- On congruences and partial orders.- Performance preorder: Ordering processes with respect to speed.- Towards a semantic theory of CML.- Modular constructions of distributing automata.- On the proof method for bisimulation.- Towards a calculus of predicate transformers.- An abstract account of composition.- Syntax and semantics of Procol.- Synthesizing distinguishing formulae for real time systems -extended abstract.- From timed automata to logic — and back.- Incremental model checking for decomposable structures.- Automata for the modal ?-calculus and related results.- A ?-calculus with local views for systems of sequential agents.- An operator calculus approach to the evolution of dynamic data structures.