Del i serien Lecture Notes in Computer Science

Fundamentals of Computation Theory

Name: Fundamentals of Computation Theory
SKU: 9783540156895
Price: 709 SEK
Availability: InStock
Author: Lothar Budach
ISBN: 9783540156895

Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985

Häftad, Engelska, 1985

AvLothar Budach

709 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

1 339 kr

Skickas inom 10-15 vardagar

Häftad

1 189 kr

Skickas inom 10-15 vardagar

Häftad

1 099 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1985-08-01
Mått155 x 235 x 31 mm
Vikt844 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor550
Upplaga1985
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540156895

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

Space complexity of alternating Turing machines.- A unifying theorem for algebraic semantics and dynamic logics.- On some "non-uniform" complexity measures.- Fast parallel vertex colouring.- Muller automata and bi-infinite words.- On formal languages, probabilities, paging and decoding algorithms.- On the restriction of some NP-complete graph problems to permutation graphs.- Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic.- Algorithms solving path systems.- Decidability of confluence for ground term rewriting systems.- Lower bounds on the complexity of 1-time only branching programs (Preliminary version).- On coordinated rewriting.- Elements of a general theory of combinatorial structures.- A language theoretic approach to serialization problem in concurrent systems.- Logic programming and substitutions.- A lower bound on the oscilation complexity of context-free languages.- Depth efficient transformations of arithmetic into boolean circuits.- Free cost measures of trees.- Discrete extremal problems on covering.- Parallel algorithms for connected components in a graph.- Statistical testing of finite sequences based on algorithmic complexity.- Lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version).- Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.- Linear comparison complexity of the n-cube membership problem.- String grammars with disconnecting.- Array processing machines.- A fast heuristic for covering polygons by rectangles.- ? ??????? ? ???????????? ?????? ????????? ??????.- Products of group languages.- The complexity of embedding graphs into binary trees.- On some topological properties of logicprograms.- Recent results on continuous ordered algebras.- Are lower bounds on the complexity lower bounds for universal circuits?.- Probabilistic algorithms in group theory.- Recent results on codes.- A multiparameter analysis of the boundedness problem for vector addition systems.- About two-way transducers.- Parallel time O(log N) recognition of unambiguous CFLs.- On colour critical graphs.- Generalized thue-morse sequences.- Tree-partite graphs and the complexity of algorithms.- A quadratic regularity test for non-deleting macro s grammars.- Continuous abstract data types: Basic machinery and results.- On the length of single dynamic tests for monotone boolean functions.- Enumerative combinatorics and algebraic languages.- On several kinds of space-bounded on-line multicounter automata.- Iterated linear control and iterated one-turn pushdowns.- On the boolean closure of NP.- The critical complexity of all (monotone) boolean functions and monotone graph properties.- Degeneration of Shimura surfaces and a problem in coding theory.- Quantifiers in combinatory PDL: Completeness, definability, incompleteness.- Partial ordering derivations for CCS.- Intersecting two polyhedra one of which is convex.

Mer från samma författare

Del 35

Automaten Und Funktoren

Lothar Budach, Hans J Hoehnke

Inbunden, 1975

2 959 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Albert Cohen - Compiler Construction, Häftad

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Yehuda Lindell - Theory of Cryptography, Häftad

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av