Mathematical Foundations of Computer Science 1986: 12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings: 233 (Lecture Notes in Computer Science, 233) - Softcover
Synopsis
Mathematical Foundations of Computer Science 1986: 12th Symposium Held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings Mathematical Foundations of Computer Science 1986: 12th Symposium Held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings
"synopsis" may belong to another edition of this title.
Search results for Mathematical Foundations of Computer Science 1986:...
Seller Image
Mathematical Foundations of Computer Science
Seller: Bookbot, Prague, Czech Republic
Seller rating 5 out of 5 stars
Condition: Fair. Unterschrift / Widmung ohne Bezug; Leichte Risse. *** please read this *** Ships from Ohio - no marks - next day shipping - tracking provided - 8-C-26. Seller Inventory # a42d290f-b084-4ae1-89f1-a22a905fb148
Buy Used
£ 11.42
Shipping:
£ 16.60
From Czech Republic to U.S.A.
Quantity: 1 available
Seller Image
Mathematical Foundations of Computer Science 1986: 12th Symposium held at bratislava, Czechoslovakia, August 25-29, 1986. Proceedings (Lecture Notes in Computer Science, 233, Band 233)
Seller: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germany
Seller rating 5 out of 5 stars
Softcover. 1986. 650 p. ATTENTION 1986 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540167839 Sprache: Englisch Gewicht in Gramm: 930. Seller Inventory # 224188
Stock Image
Mathematical Foundations of Computer Science 1986: 12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings (Lecture Notes in Computer Science, 233)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020161172
Seller Image
Mathematical Foundations of Computer Science 1986 : 12th Symposium Held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5890826-n
Seller Image
Mathematical Foundations of Computer Science 1986 : 12th Symposium Held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 5890826
Stock Image
Mathematical Foundations of Computer Science 1986: 12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings (Lecture Notes in Computer Science, 233)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783540167839
Seller Image
Mathematical Foundations of Computer Science 1986
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1986, 1986
ISBN 10: 3540167838
ISBN 13: 9783540167839
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Why sometimes probabilistic algorithms can be more effective.- Recent results in the theory of rational sets.- Partial interpretations of higher order algebraic types.- Kins of context-free languages.- Algebraic theory of module specifications with constraints.- A semantical model for integration and modularization of rules.- Parallel arithmetic computations: A survey.- An approach to proof checker.- The promise of electronic prototyping.- Systolic arrays: Characterizations and complexity.- Geometric location problems and their complexity.- Developing implicit data structures.- Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs.- Deterministic simulation of idealized parallel computers on more realistic ones.- Relational specifications and observational semantics.- Efficient testing of optimal time adders.- Properties of complexity measures for PRAMs and WARMs.- Iterative systems of equations.- Polynomial complexity of the Newton-Puiseux algorithm.- Unique decipherability for partially commutative alphabet (extended abstract).- The equivalence of finite valued transducers (on HDTOL languages) is decidable.- A fast parallel algorithm for six-colouring of planar graphs.- Quicksort without a stack.- Towards an efficient merging.- Homomorphic realization of automata with compositions.- Refined bounds on the complexity of sorting and selection in d - dimensional space.- On the inherent combinatorial complexity of geometric problems in d - dimensional space.- The evolution of two stacks in bounded space and random walks in a triangle.- P-genericity and strong p-genericity.- Fibonacci numeration systems and rational functions.- Safe implementation equivalence for asynchronous nondeterministic processes.- Grammars with context dependency restricted to synchronization.- Some improved parallelisms for graphs.- A complete inference system for an algebra of regular acceptance models.- Nondeterministic Turing machines with modified acceptance.- Remark on the power of compass.- Regular chain code picture languages of nonlinear descriptional complexity.- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines.- A new approach to defining the communication complexity for VLSI.- Lower bounds on the complexity of local circuits.- Optimal sorting of seven element sets.- Undecidable problems concerning generalized pascal triangles of commutative algebras.- Regular augmentation of automata and transducers.- On some types of pseudo-random sequences.- The space complexity of the accessibility problem for undirected graphs of log n bounded genus.- An alternative, priority-free, solution to Post's problem.- Near optimal algorithms for finding minimum Steiner trees on random graphs.- Matrix systems and principal cones of algebraic power series.- Two characterizations of the logarithmic alternation hierarchy.- p-Projection reducibility and the complexity classes (nonuniform) and N (nonuniform).- A proof system to derive eventuality properties under justice hypothesis.- Al-Khowarizmi : A formal system for higher-order logic programming.- One-sided Dyck reduction over two letter alphabet and deterministic context-free languages.- Model and complexity of termination for distributed computations.- Complexity of generalized graph coloring.- The parallel complexity of deadlock detection.- The centers of context-sensitive languages.- A greedy algorithm for constructing shortest common superstrings.- The OI-hierarchy is closed under control.- On the degree of ambiguity of finite automata.- Learning in knowledge based systems, a possibilistic approach.- Proofs that Release Minimum Knowledge. 668 pp. Englisch. Seller Inventory # 9783540167839
Seller Image
Mathematical Foundations of Computer Science 1986 : 12th Symposium Held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5890826-n
Buy New
£ 104.84
Shipping:
£ 15
From United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Mathematical Foundations of Computer Science 1986 : 12th Symposium Held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 5890826
Buy Used
£ 107.75
Shipping:
£ 15
From United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Mathematical Foundations of Computer Science 1986
Published by
Springer Berlin Heidelberg, 1986
ISBN 10: 3540167838
ISBN 13: 9783540167839
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Why sometimes probabilistic algorithms can be more effective.- Recent results in the theory of rational sets.- Partial interpretations of higher order algebraic types.- Kins of context-free languages.- Algebraic theory of module specifications with constrai. Seller Inventory # 4883198