Produktart
Zustand
Einband
Weitere Eigenschaften
Land des Verkäufers
Verkäuferbewertung
Verlag: Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
Buch
Zustand: Good. *Price HAS BEEN REDUCED by 10% until Monday, April 29 (sale item)* 589 pp., Paperback, ex library, spine and joints worn, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Verlag: Berlin, Springer Berlin Heidelberg, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Buch
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7856 3540108564 Sprache: Englisch Gewicht in Gramm: 900.
Zustand: Good. Good condition. This is the average used book, that has all pages or leaves present, but may include writing. Book may be ex-library with stamps and stickers.
Verlag: Berlin ; Heidelberg [u.a.] : Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Deutschland
Buch
Softcover. 1981. XI, 589 S. : graph. Darst. Edition 1981! Unread book. Very good condition. Slight traces of storage. 9783540108566 Sprache: Englisch Gewicht in Gramm: 1001.
Verlag: Springer, 2008
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Buch
Paperback. Zustand: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.
Verlag: Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: GF Books, Inc., Hawthorne, CA, USA
Buch
Zustand: Very Good. Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting.
Verlag: Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: booksXpress, Bayonne, NJ, USA
Buch
Soft Cover. Zustand: new.
Zustand: New.
Verlag: Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Buch Print-on-Demand
Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Verlag: Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: Books Puddle, New York, NY, USA
Buch
Zustand: New. pp. 608.
Verlag: Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Buch Print-on-Demand
Zustand: New. Print on Demand pp. 608 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Verlag: Springer Berlin Heidelberg, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The complexity of manipulating hierarchically defined sets of rectangles.- The transformational machine: Theme and variations.- Probabilistic two-way machines.- A survey of some recent results on computational complexity in weak theories of arithmetic.- A survey on oracle techniques.- Time and space bounded complexity classes and bandwidth constrained problems.- Representations of graphs by means of products and their complexity.- Parsing strategies: A concise survey.- The art of dynamizing.- Fast parallel computation of polynomials using few processors.- Generalizations of Petri nets.- Partial match retrieval in implicit data structures.- A characterization of Floyd-provable programs.- Semantics of CSP via translation into CCS.- More about the geography of context-free languages.- On the power of algebraic specifications.- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages.- On the complexity of word problems in certain Thue systems.- On the transformation of derivation graphs to derivation trees.- Pushdown automata with restricted use of storage symbols.- Structured nets.- Retraceability, repleteness and busy beaver sets.- Combining T and level-N.- On realization and implementation.- Multiplicative complexity of a bilinear form over a commutative ring.- Making dynamic logic first-order.- Partial interpretations of program schemata.- Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata.- Another hierarchy defined by multihead finite automata.- An extension of Rabin's complete proof concept.- How to find invariants for coloured Petri nets.- Relationships between probabilistic and deterministic tape complexity.- Grammatical levels of the position restricted grammars.- A general framework for comparing sequential and parallel rewriting.- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit.- Codings of nonnegative integers.- The maximum k-flow in a network.- On the constructive description of graph languages accepted by finite automata.- Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries.- Maximum flow in planar networks.- Probabilistic combinatorial optimization.- Time-processor trade-offs for universal parallel computers.- Negative results on the size of deterministic right parsers.- Key-equivalence of functional dependency statements systems.- On representation of dynamic algebras with reversion.- A framework for studying grammars.- On existence of complete predicate calculus in metamathematics without exponentiation.- On structural similarity of context-free grammars.- Axioms for the term-wise correctness of programs.- Complexity and entropy.- Axiomatic semantics of indirect addressing.- Testing of join dependency preserving by a modified chase method.- A starvation-free solution of the dining philosophers' problem by use of interaction systems.- Admissible representations of effective cpo's.- Preserving total order in constant expected time.- Constructive category theory (No. 1).- Two pebbles don't suffice.
Verlag: Springer Berlin Heidelberg, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: moluna, Greven, Deutschland
Buch Print-on-Demand
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The complexity of manipulating hierarchically defined sets of rectangles.- The transformational machine: Theme and variations.- Probabilistic two-way machines.- A survey of some recent results on computational complexity in weak theories of arithmetic.- A s.
Verlag: Springer Berlin Heidelberg Aug 1981, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Buch Print-on-Demand
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The complexity of manipulating hierarchically defined sets of rectangles.- The transformational machine: Theme and variations.- Probabilistic two-way machines.- A survey of some recent results on computational complexity in weak theories of arithmetic.- A survey on oracle techniques.- Time and space bounded complexity classes and bandwidth constrained problems.- Representations of graphs by means of products and their complexity.- Parsing strategies: A concise survey.- The art of dynamizing.- Fast parallel computation of polynomials using few processors.- Generalizations of Petri nets.- Partial match retrieval in implicit data structures.- A characterization of Floyd-provable programs.- Semantics of CSP via translation into CCS.- More about the geography of context-free languages.- On the power of algebraic specifications.- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages.- On the complexity of word problems in certain Thue systems.- On the transformation of derivation graphs to derivation trees.- Pushdown automata with restricted use of storage symbols.- Structured nets.- Retraceability, repleteness and busy beaver sets.- Combining T and level-N.- On realization and implementation.- Multiplicative complexity of a bilinear form over a commutative ring.- Making dynamic logic first-order.- Partial interpretations of program schemata.- Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata.- Another hierarchy defined by multihead finite automata.- An extension of Rabin's complete proof concept.- How to find invariants for coloured Petri nets.- Relationships between probabilistic and deterministic tape complexity.- Grammatical levels of the position restricted grammars.- A general framework for comparing sequential and parallel rewriting.- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit.- Codings of nonnegative integers.- The maximum k-flow in a network.- On the constructive description of graph languages accepted by finite automata.- Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries.- Maximum flow in planar networks.- Probabilistic combinatorial optimization.- Time-processor trade-offs for universal parallel computers.- Negative results on the size of deterministic right parsers.- Key-equivalence of functional dependency statements systems.- On representation of dynamic algebras with reversion.- A framework for studying grammars.- On existence of complete predicate calculus in metamathematics without exponentiation.- On structural similarity of context-free grammars.- Axioms for the term-wise correctness of programs.- Complexity and entropy.- Axiomatic semantics of indirect addressing.- Testing of join dependency preserving by a modified chase method.- A starvation-free solution of the dining philosophers' problem by use of interaction systems.- Admissible representations of effective cpo's.- Preserving total order in constant expected time.- Constructive category theory (No. 1).- Two pebbles don't suffice. 608 pp. Englisch.
Zustand: New. Buy with confidence! Book is in new, never-used condition.
Verlag: Springer, 1981
ISBN 10: 3540108564ISBN 13: 9783540108566
Anbieter: dsmbooks, Liverpool, Vereinigtes Königreich
Buch
Paperback. Very Good Dust Jacket may be missing.CDs may be missing. book.