Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germania
Softcover. 1986. 650 p. ATTENTION 1986 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540167839 Sprache: Englisch Gewicht in Gramm: 930.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: booksXpress, Bayonne, NJ, U.S.A.
Soft Cover. Condizione: new.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: California Books, Miami, FL, U.S.A.
Condizione: New.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: GreatBookPricesUK, Castle Donington, DERBY, Regno Unito
Condizione: New.
Editore: Springer Berlin Heidelberg, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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.
Editore: Springer Berlin Heidelberg, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: moluna, Greven, Germania
Condizione: 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.
Editore: Springer Berlin Heidelberg Aug 1986, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: GreatBookPricesUK, Castle Donington, DERBY, Regno Unito
Condizione: As New. Unread book in perfect condition.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New.
Editore: Springer, 1986
ISBN 10: 3540167838 ISBN 13: 9783540167839
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New.