Vendeur : Bookbot, Prague, Rébublique tchèque
Softcover. Etat : Fine. Leichte Risse; Farbveränderung durch Alter/Sonne. N° de réf. du vendeur 7e9b1594-92e3-4e1e-9557-dae87152db55
Quantité disponible : 1 disponible(s)
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
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. N° de réf. du vendeur 2347554
Quantité disponible : 1 disponible(s)
Vendeur : Roland Antiquariat UG haftungsbeschränkt, Weinheim, Allemagne
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. N° de réf. du vendeur 215040
Quantité disponible : 1 disponible(s)
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Paperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. N° de réf. du vendeur UTD14a-0215
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020159154
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783540108566_new
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540108566
Quantité disponible : 2 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 608. N° de réf. du vendeur 263072910
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : 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. N° de réf. du vendeur 5856337
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. 608. N° de réf. du vendeur 183072900
Quantité disponible : 4 disponible(s)