Mathematical Foundations of Computer Science 1986: 12th Symposium held at bratislava, Czechoslovakia, August 25-29, 1986. Proceedings: 233 (Lecture Notes in Computer Science) - Tapa blanda

Rovan, Branislav; Gruska, Jozef; Wiedermann, Juraj

9783540167839: Mathematical Foundations of Computer Science 1986: 12th Symposium held at bratislava, Czechoslovakia, August 25-29, 1986. Proceedings: 233 (Lecture Notes in Computer Science)

Tapa blanda

ISBN 10: 3540167838 ISBN 13: 9783540167839

Editorial: Springer, 2008

Ver todas las copias de esta edici�n del ISBN

4 Usado

De EUR 23,96

16 Nuevo

De EUR 92,27

Fundamentos matem�ticos de la inform�tica 1986: 12� simposio celebrado en Bratislava, Checoslovaquia, 25-29 de agosto de 1986. Proceedings Mathematical Foundations of Computer Science 1986: 12� Simposio celebrado en Bratislava, Checoslovaquia, del 25 al 29 de agosto de 1986. Procedimientos

"Sinopsis" puede pertenecer a otra edici�n de este libro.

Editorial: Springer
A�o de publicaci�n: 2008
Idioma: Ingl�s
ISBN 10: 3540167838
ISBN 13: 9783540167839
Encuadernaci�n: Tapa blanda
N�mero de p�ginas: 668
Contacto del fabricante: no disponible
Persona responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Comprar usado

Condici�n: Regular

Unterschrift / Widmung ohne Bezug...

Ver este art�culo

EUR 23,96

Convertir moneda

EUR 5,99 gastos de env�o desde Republica Checa a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Comprar nuevo

Ver este art�culo

EUR 92,27

Convertir moneda

EUR 19,49 gastos de env�o desde Alemania a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Resultados de la b�squeda para Mathematical Foundations of Computer Science 1986:...

Imagen del vendedor

Mathematical Foundations of Computer Science

kolektiv

Publicado por Springer, 1986

ISBN 10: 3540167838 ISBN 13: 9783540167839

Antiguo o usado Tapa blanda

Librería: Bookbot, Prague, Republica Checa

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: Fair. Unterschrift / Widmung ohne Bezug; Leichte Risse. *** please read this *** Ships from Ohio - no marks - next day shipping - tracking provided - 8-C-26. N� de ref. del art�culo: a42d290f-b084-4ae1-89f1-a22a905fb148

Contactar al vendedor

Comprar usado

EUR 23,96

Convertir moneda

Gastos de env�o: EUR 5,99

De Republica Checa a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical Foundations of Computer Science 1986: 12th Symposium held at bratislava, Czechoslovakia, August 25-29, 1986. Proceedings (Lecture Notes in Computer Science, 233, Band 233)

Rovan, Branislav, Jozef Gruska und Juraj Wiedermann:

Publicado por Springer, 1986

ISBN 10: 3540167838 ISBN 13: 9783540167839

Antiguo o usado Softcover

Librería: Roland Antiquariat UG haftungsbeschr�nkt, Weinheim, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Softcover. 1986. 650 p. ATTENTION 1986 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540167839 Sprache: Englisch Gewicht in Gramm: 930. N� de ref. del art�culo: 224188

Contactar al vendedor

Comprar usado

EUR 30,00

Convertir moneda

Gastos de env�o: EUR 11,95

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical Foundations of Computer Science 1986

Gruska, Josef|Rovan, Branislav|Wiedermann, Juraj

Publicado por Springer Berlin Heidelberg, 1986

ISBN 10: 3540167838 ISBN 13: 9783540167839

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 4 de 5 estrellas

Condici�n: 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. N� de ref. del art�culo: 4883198

Contactar al vendedor

Comprar nuevo

EUR 92,27

Convertir moneda

Gastos de env�o: EUR 19,49

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen de archivo

Mathematical Foundations of Computer Science 1986: 12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings (Lecture Notes in Computer Science, 233)

Rovan, Branislav; Gruska, Jozef; Wiedermann, Juraj

Publicado por Springer, 1986

ISBN 10: 3540167838 ISBN 13: 9783540167839

Nuevo Tapa blanda

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. In. N� de ref. del art�culo: ria9783540167839_new

Contactar al vendedor

Comprar nuevo

EUR 111,37

Convertir moneda

Gastos de env�o: EUR 5,16

De Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical Foundations of Computer Science 1986 : 12th Symposium Held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings

Gruska, Jozef; Rovan, Branislav; Wiedermann, Juraj

Publicado por Springer, 1986

ISBN 10: 3540167838 ISBN 13: 9783540167839

Nuevo Tapa blanda

Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. N� de ref. del art�culo: 5890826-n

Contactar al vendedor

Comprar nuevo

EUR 101,62

Convertir moneda

Gastos de env�o: EUR 17,04

De Estados Unidos de America a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical Foundations of Computer Science 1986 : 12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings

Jozef Gruska

Publicado por Springer Berlin Heidelberg, 1986

ISBN 10: 3540167838 ISBN 13: 9783540167839

Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: 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. N� de ref. del art�culo: 9783540167839

Contactar al vendedor