LEADER 05066nam  22007095  450 
001 996465613103316
005 20200703011651.0
010   $a3-540-46945-1
024 7 $a10.1007/3-540-52282-4
035   $a(CKB)1000000000233496
035   $a(SSID)ssj0000326864
035   $a(PQKBManifestationID)11264720
035   $a(PQKBTitleCode)TC0000326864
035   $a(PQKBWorkID)10297418
035   $a(PQKB)10154935
035   $a(DE-He213)978-3-540-46945-2
035   $a(PPN)155168495
035   $a(EXLCZ)991000000000233496
100   $a20121227d1990      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aSTACS 90$b[electronic resource] $e7th Annual Symposium on Theoretical Aspects of Computer Science. Rouen, France, February 22-24, 1990. Proceedings /$fedited by Christian Choffrut, Thomas Lengauer
205   $a1st ed. 1990.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1990.
215   $a1 online resource (X, 318 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v415
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-52282-4 
327   $aA note on the almost-everywhere hierarchy for nondeterministic time -- The ring of k-regular sequences -- Minimal pairs and complete problems -- Hiding instances in multioracle queries -- Counting classes: Thresholds, parity, mods, and fewness -- Playing games of incomplete information -- Caterpillars and context-free languages -- Semi-commutations and algebraic languages -- Towards a process semantics in the logic programming style -- Parallel computations on strings and arrays -- Minimum vertex hulls for polyhedral domains -- Combinatorial rewriting on traces -- Kolmogorov complexity, restricted nondeterminism and generalized spectra -- Relation-sorted algebraic specifications with built-in coercers: Basic notions and results -- Computational power of one-way multihead finite automata -- Updating almost complete trees or one level makes all the difference -- Sorting the sums (xi+yj) in O(n2) comparisons -- Efficient checking of computations -- Hard promise problems and nonuniform complexity -- On the construction of abstract voronoi diagrams -- Approximation of convex figures by pairs of rectangles -- Nonblocking graphs: Greedy algorithms to compute disjoint paths -- Infinite trees and automaton definable relations over ?-words -- Enumerative Combinatorics and Computer Science -- Failures semantics based on interval semiwords is a congruence for refinement -- The analysis of local search problems and their heuristics.
330   $aThe Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association Française de Cybernétique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft für Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v415
606   $aComputers
606   $aAlgorithms
606   $aComputer logic
606   $aMathematical logic
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
615  0$aComputers.
615  0$aAlgorithms.
615  0$aComputer logic.
615  0$aMathematical logic.
615 14$aTheory of Computation.
615 24$aComputation by Abstract Devices.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Formal Languages.
676   $a004
702   $aChoffrut$b Christian$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aLengauer$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 02$aAssociation franc?aise pour la cyberne?tique e?conomique et technique.
712 02$aGesellschaft fu?r Informatik.
712 12$aSymposium on Theoretical Aspects of Computer Science
906   $aBOOK
912   $a996465613103316
996   $aSTACS 90$92830554
997   $aUNISA