Produktart
Zustand
Einband
Weitere Eigenschaften
Land des Verkäufers
Verkäuferbewertung
Verlag: Springer-Verlag Telos, 1998
ISBN 10: 3540648275ISBN 13: 9783540648277
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
Buch
Zustand: Good. *Price HAS BEEN REDUCED by 10% until Monday, April 29 (sale item)* 846 pp., thick paperback, ex library, else text clean & 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: 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: Springer-Verlag, 1986
ISBN 10: 0387167838ISBN 13: 9780387167831
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Buch
Paperback. Zustand: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
Verlag: Springer-Verlag, 1986
ISBN 10: 0387167838ISBN 13: 9780387167831
Anbieter: MyLibraryMarket, Waynesville, OH, USA
Buch
Paperback. Zustand: As New. *** please read this *** Ships from Ohio - no marks bn2-c-18*.
Springer-Verlag, Berlin 1977. X, 595 pp. Printed wrapper. Fine condition. (Lecture Notes in Computer Science 53).
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 1977-08-01, 1977
ISBN 10: 3540083537ISBN 13: 9783540083535
Anbieter: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Vereinigtes Königreich
Buch
Paperback. Zustand: Good. Some wear to the extremities of the book. A few scratches to both sides. Content is clean and readable, inscription at the front.
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.
Soft Cover. Zustand: new.
Verlag: Springer, 1977
ISBN 10: 3540083537ISBN 13: 9783540083535
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Buch
Zustand: New.
Verlag: Springer, 1977
ISBN 10: 3540083537ISBN 13: 9783540083535
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 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.
Verlag: Springer Berlin Heidelberg Aug 1977, 1977
ISBN 10: 3540083537ISBN 13: 9783540083535
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 -On the structure and properties of NP-complete problems and their associated optimization problems.- A comparative review of some program verification methods.- Classification of the context-free languages.- Finite automaton from a flowchart scheme point of view.- A new type of models of computation.- Correctness of mixed computation in ALGOL-like programs.- Algebra and logic in theoretical computer science.- A survey of recent problems and results in analytic computational complexity.- Tree-structures for set manipulation problems.- Applied algorithmic logic.- Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials.- Frequency algorithms and computations.- Graph-theoretic arguments in low-level complexity.- Properties of complexity classes a short survey.- A uniform approach to inductive posets and inductive closure.- Generalized probabilistic grammars.- Classes of structurally isomorphic np-optimization problems.- Pushdown-automata and families of languages generating cylinders.- Semantics of infinite processes using generalized trees.- Characterization of recognizable families by means of regular languages.- An algebraic approach to problem solution and problem semantics.- Complexity and minimality of context-free grammars and languages.- Comparison of the active visiting and the crossing complexities.- Arithmetical complexity of some problems in computer science.- Formal transformations and the development of programs.- Optimal rasp programs for arbitrarily complex 0¿1 valued functions.- The expressive power of intensional logic in the semantics of programming languages.- On the complexity of equivalent transformations in programming languages.- Schematology in a MJ I/T I-language OPT imizer.- Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions.- A top-down no backtrack parsing of general context-free languages.- A probabilistic restriction of branching plans.- Reducing operators for normed general formal systems.- Invariant properties of informational bulks.- Two decidability results for deterministic pushdown automata.- On the logic of incomplete information.- Measures of ambiguity in the analysis of complex systems.- Two-level meta-controlled substitution grammars.- A calculus to build up correct programs.- Another approach for proving program correctness.- Cover results and normal forms.- On a deterministic subclass of context-free languages.- Exponential optimization for the LLP(k) parsing method.- The medial axis of a simple polygon.- Semantics and proof rules for coroutine hierarchies in block-structured programming languages.- Acceptors for iteration languages.- How good is the adversary lower bound .- Total correctness for procedures.- A model for retrieval systems and some mathematical problems behind.- Time and tape bounded auxiliary pushdown automata.- A fast non-commutative algorithm for matrix multiplication.- Fixed-points and algebras with infinitely long expressions, I.- On languages, accepted by machines in the category of sets.- Real time computations with restrictions on tape alphabet.- The bodnarchuk metric space of languages and the topology of the learning space.- Complexity hierarchies of oracles.- Determining processes by violations.- The influence of the machine model on the time complexity of context-free language recognition.- A generalized computability thesis.- Identification of formal languages.- Correctness of recursive flow diagram programs. 612 pp. Englisch.
Zustand: New. Buy with confidence! Book is in new, never-used condition.
Verlag: Springer Berlin Heidelberg, 1977
ISBN 10: 3540083537ISBN 13: 9783540083535
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. On the structure and properties of NP-complete problems and their associated optimization problems.- A comparative review of some program verification methods.- Classification of the context-free languages.- Finite automaton from a flowchart scheme point of.
Verlag: Springer Berlin Heidelberg, 1977
ISBN 10: 3540083537ISBN 13: 9783540083535
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - On the structure and properties of NP-complete problems and their associated optimization problems.- A comparative review of some program verification methods.- Classification of the context-free languages.- Finite automaton from a flowchart scheme point of view.- A new type of models of computation.- Correctness of mixed computation in ALGOL-like programs.- Algebra and logic in theoretical computer science.- A survey of recent problems and results in analytic computational complexity.- Tree-structures for set manipulation problems.- Applied algorithmic logic.- Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials.- Frequency algorithms and computations.- Graph-theoretic arguments in low-level complexity.- Properties of complexity classes a short survey.- A uniform approach to inductive posets and inductive closure.- Generalized probabilistic grammars.- Classes of structurally isomorphic np-optimization problems.- Pushdown-automata and families of languages generating cylinders.- Semantics of infinite processes using generalized trees.- Characterization of recognizable families by means of regular languages.- An algebraic approach to problem solution and problem semantics.- Complexity and minimality of context-free grammars and languages.- Comparison of the active visiting and the crossing complexities.- Arithmetical complexity of some problems in computer science.- Formal transformations and the development of programs.- Optimal rasp programs for arbitrarily complex 0¿1 valued functions.- The expressive power of intensional logic in the semantics of programming languages.- On the complexity of equivalent transformations in programming languages.- Schematology in a MJ I/T I-language OPT imizer.- Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions.- A top-down no backtrack parsing of general context-free languages.- A probabilistic restriction of branching plans.- Reducing operators for normed general formal systems.- Invariant properties of informational bulks.- Two decidability results for deterministic pushdown automata.- On the logic of incomplete information.- Measures of ambiguity in the analysis of complex systems.- Two-level meta-controlled substitution grammars.- A calculus to build up correct programs.- Another approach for proving program correctness.- Cover results and normal forms.- On a deterministic subclass of context-free languages.- Exponential optimization for the LLP(k) parsing method.- The medial axis of a simple polygon.- Semantics and proof rules for coroutine hierarchies in block-structured programming languages.- Acceptors for iteration languages.- How good is the adversary lower bound .- Total correctness for procedures.- A model for retrieval systems and some mathematical problems behind.- Time and tape bounded auxiliary pushdown automata.- A fast non-commutative algorithm for matrix multiplication.- Fixed-points and algebras with infinitely long expressions, I.- On languages, accepted by machines in the category of sets.- Real time computations with restrictions on tape alphabet.- The bodnarchuk metric space of languages and the topology of the learning space.- Complexity hierarchies of oracles.- Determining processes by violations.- The influence of the machine model on the time complexity of context-free language recognition.- A generalized computability thesis.- Identification of formal languages.- Correctness of recursive flow diagram programs.
Verlag: Thomson Learning, 1997
ISBN 10: 1850322430ISBN 13: 9781850322436
Anbieter: dsmbooks, Liverpool, Vereinigtes Königreich
Buch
paperback. Zustand: No Dust Jacket. No Cds. Good. book.
Verlag: Springer Verlag, 1998
ISBN 10: 3540648275ISBN 13: 9783540648277
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Buch
Paperback. Zustand: Brand New. 1st edition. 846 pages. 9.50x6.25x1.50 inches. In Stock.
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.
Verlag: Springer, 1977
ISBN 10: 3540083537ISBN 13: 9783540083535
Anbieter: Books Puddle, New York, NY, USA
Buch
Zustand: New. pp. 616.