| 000 | 04543nam a22004335i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-39636-9 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101944.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1985 gw | s |||| 0|eng d | ||
| 020 |
_a9783540396369 _9978-3-540-39636-9 |
||
| 024 | 7 |
_a10.1007/BFb0028784 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYZG _2bicssc |
|
| 072 | 7 |
_aCOM037000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aFundamentals of Computation Theory _h[electronic resource] : _bFCT '85 Cottbus, GDR, September 9–13, 1985 / _cedited by Lothar Budach. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
| 300 |
_aXIV, 550 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v199 |
|
| 505 | 0 | _aSpace 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 logic programs -- 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. | |
| 650 | 0 | _aComputer science. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aComputation by Abstract Devices. |
| 700 | 1 |
_aBudach, Lothar. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540156895 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v199 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0028784 |
| 942 |
_2EBK4676 _cEBK |
||
| 999 |
_c33970 _d33970 |
||