ISBN: 9783540447689
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. T… Mehr…
| Springer.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540447689
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. T… Mehr…
| Springer.com Nr. 978-3-540-44768-9. Versandkosten:Worldwide free shipping, , zzgl. Versandkosten. Details... |
ISBN: 9783540447689
Computer Science; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languag… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten Details... |
ISBN: 9783540447689
Computer Science; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languag… Mehr…
| Springer.com Versandkosten: EUR 0.00 Details... |
ISBN: 9783540447689
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. T… Mehr…
ISBN: 9783540447689
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. T… Mehr…
ISBN: 9783540447689
Computer Science; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languag… Mehr…
ISBN: 9783540447689
Computer Science; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languag… Mehr…
Bibliographische Daten des bestpassenden Buches
| Autor: | |
| Titel: | |
| ISBN-Nummer: |
Detailangaben zum Buch - Mathematical Foundations of Computer Science 1995
EAN (ISBN-13): 9783540447689
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-06-04T13:28:06+02:00 (Vienna)
Detailseite zuletzt geändert am 2023-12-02T15:34:30+01:00 (Vienna)
ISBN/EAN: 9783540447689
ISBN - alternative Schreibweisen:
978-3-540-44768-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: wiedermann, jiri hajek
Titel des Buches: foundations science, computer science
Daten vom Verlag:
Autor/in: Jiri Wiedermann; Petr Hajek
Titel: 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
Verlag: Springer; Springer Berlin
594 Seiten
Erscheinungsjahr: 2005-07-14
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIII, 594 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; complexity; complexity theory; formal language; model checking; semantics; algorithm analysis and problem complexity; C; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Compilers and Interpreters; Computer Science; Algorithmen und Datenstrukturen; Compiler und Übersetzer; BC
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.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783540318675 Mathematical Foundations of Computer Science 2005 (Joanna Jedrzejowicz; Andrzej Szepietowski)
- 9783540318675 Mathematical Foundations of Computer Science 2005 (Joanna Jedrzejowicz; Andrzej Szepietowski)
- 9783540602460 Mathematical Foundations of Computer Science 1995 (Jiri Wiedermann/ Petr Hájek)
- 9783540377917 Mathematical Foundations of Computer Science 2006 (Rastislav Královic; Pawel Urzyczyn)
- 9783540287025 Mathematical Foundations of Computer Science 2005 (Andrzej Szepietowski)
- 9780387571829 Mathematical Foundations of Computer Science 1993: 18th International Symposium, Mfcs'93, Gdansk, Poland, August 30-September 3, 1993 Proceedings (Symposium ... Foundations of Computer Science) (Andrzej M. Borzyszkowski, Stefan Sokolowski)
< zum Archiv...