EUR 10,23
Währung umrechnenAnzahl: 1 verfügbar
In den Warenkorbpaperback. Zustand: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.
EUR 10,23
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: Very Good. This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. .
EUR 9,16
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned.
Anbieter: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Deutschland
Softcover. 1986. 650 p. ATTENTION 1986 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540167839 Sprache: Englisch Gewicht in Gramm: 930.
EUR 29,54
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: Fair. Unterschrift / Widmung ohne Bezug; Leichte Risse. *** please read this *** Ships from Ohio - no marks - next day shipping - tracking provided - 8-C-26.
Verlag: McGraw-Hill, 1999
Anbieter: Antiquariat Mang, Saarbrücken, Deutschland
EUR 25,00
Währung umrechnenAnzahl: 1 verfügbar
In den Warenkorbbroschiert, 0. 439 S., broschiert, Deckel und Block leicht hochgebogen, Schnitt leicht fleckig, sonst gut, Porto innerhalb Deutschlands 6,50 da über 1 Kg, 1,100 kg.
EUR 44,00
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: Good. Paperback, illustrated with numerous equations, graphs and diagrams, 8vo.
Verlag: Springer Berlin Heidelberg, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 106,99
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 111,65
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 103,73
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Best Price, Torrance, CA, USA
EUR 95,78
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: New. SUPER FAST SHIPPING.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 111,63
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: California Books, Miami, FL, USA
EUR 126,03
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 121,26
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 127,74
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 102,56
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Springer Berlin Heidelberg, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
EUR 92,27
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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.
Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1986, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Sprache: Englisch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
EUR 106,99
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 668 pp. Englisch.
Verlag: Springer Berlin Heidelberg Aug 1986, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
EUR 128,39
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: 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.