Fundamentals of Computation Theory
Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985
538 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Produktinformation
- Utgivningsdatum:1985-08-01
- Mått:155 x 235 x 31 mm
- Vikt:844 g
- Format:Häftad
- Språk:Engelska
- Serie:Lecture Notes in Computer Science
- Antal sidor:550
- Upplaga:1985
- Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN:9783540156895
Utforska kategorier
Innehållsförteckning
- 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 serie
Multiobjective Optimization
Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński
Häftad, 2008
554 kr
Knowledge Graphs
Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang
Häftad, 2026
932 kr
Agent Mediated Electronic Commerce II
Alexandros Moukas, Carles Sierra, Fredrik Ygge
Häftad, 2000
571 kr
- Nyhet
Advanced Parallel Processing Technologies
Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson
Häftad, 2026
1 022 kr
Progress in Cryptology - AFRICACRYPT 2026
Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez
Häftad, 2026
932 kr
- Nyhet
Electronic Participation
David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek
Häftad, 2026
730 kr
Sustainable Digital Communities
Anneli Sundqvist, Gerd Berget, Jan Nolin, Kjell Ivar Skjerdingstad
Häftad, 2020
1 071 kr
Types for Proofs and Programs
Thierry Coquand, Peter Dybjer, Bengt Nordström, Jan Smith
Häftad, 2000
571 kr
Requirements Engineering: Foundation for Software Quality
Vincenzo Gervasi, Andreas Vogelsang
Häftad, 2022
627 kr
Component-Based Software Engineering
Heinz G. Schmidt, Ivica Crnkovic, George T. Heineman, Judith A. Stafford
Häftad, 2007
571 kr
Du kanske också är intresserad av
Fundamentals of Computation Theory
Lothar Budach, Rais G. Bukharajev, Oleg B. Lupanov
Häftad, 1987
556 kr