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) - Taschenbuch
1995, ISBN: 9783540602460
Springer, 1995. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 16 (weekend sale item)* 588 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, t… Mehr…
Biblio.co.uk |
Mathematical Foundations of Computer Science 1995 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings - neues Buch
1995, ISBN: 3540602461
1995 Kartoniert / Broschiert EDV / Theorie / Informatik / Mathematik, Mathematik / Informatik, Computer, Compiler und Übersetzer, Theoretische Informatik, algorithm; algorithms; complex… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
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) - Taschenbuch
1995, ISBN: 9783540602460
Springer, 1995. 588 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once… Mehr…
Biblio.co.uk |
ISBN: 9783540602460
*Mathematical Foundations of Computer Science 1995* - 20th International Symposium MFCS'95 Prague Czech Republic August 28 - September 1 1995. Proceedings. Auflage 1995 / Taschenbuch für … Mehr…
Hugendubel.de Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 3.95) Details... |
1995, ISBN: 9783540602460
Taschenbuch
20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1995
lehmanns.de Versandkosten:Versand in 10-14 Tagen. (EUR 0.00) Details... |
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) - Taschenbuch
1995, ISBN: 9783540602460
Springer, 1995. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 16 (weekend sale item)* 588 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, t… Mehr…
Hajek, Petr (Herausgeber); Wiedermann, Jiri (Herausgeber):
Mathematical Foundations of Computer Science 1995 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings - neues Buch1995, ISBN: 3540602461
1995 Kartoniert / Broschiert EDV / Theorie / Informatik / Mathematik, Mathematik / Informatik, Computer, Compiler und Übersetzer, Theoretische Informatik, algorithm; algorithms; complex… Mehr…
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) - Taschenbuch
1995
ISBN: 9783540602460
Springer, 1995. 588 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once… Mehr…
ISBN: 9783540602460
*Mathematical Foundations of Computer Science 1995* - 20th International Symposium MFCS'95 Prague Czech Republic August 28 - September 1 1995. Proceedings. Auflage 1995 / Taschenbuch für … Mehr…
1995, ISBN: 9783540602460
Taschenbuch
20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1995
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Mathematical Foundations of Computer Science 1995
EAN (ISBN-13): 9783540602460
ISBN (ISBN-10): 3540602461
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1995
Herausgeber: Springer Berlin Heidelberg
612 Seiten
Gewicht: 0,912 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-04-04T10:53:18+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-12-02T15:34:45+01:00 (Berlin)
ISBN/EAN: 3540602461
ISBN - alternative Schreibweisen:
3-540-60246-1, 978-3-540-60246-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: wiedermann, petr, jiri hajek, andrzej just
Titel des Buches: mfc, czech republic, 1995 band, republic com, mathematical foundations computer science, the mathematical foundations, august 1995, international proceedings, mfcs
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: 1995-08-16
Berlin; Heidelberg; DE
Sprache: Englisch
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.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783540447689 Mathematical Foundations of Computer Science 1995 (Jiri Wiedermann; Petr Hajek)
- 9783540447689 Mathematical Foundations of Computer Science 1995 (Jiri Wiedermann; Petr Hajek)
- 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)
- 9780387543451 Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991 Proceedings (TARLECKI, A. (ED.))
- Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 September 2, 2005. Proceedings (English Edition) (Bienkowski, Marcin, Meyer auf der Heide (auth.), Friedhelm, J?drzejowicz, Joanna, Szepietowski (eds.), Andrzej)
< zum Archiv...