LEADER 05346nam  22007215  450 
001 996465324103316
005 20220920151220.0
010   $a3-540-46612-6
024 7 $a10.1007/3-540-54967-6
035   $a(CKB)1000000000233752
035   $a(SSID)ssj0000323283
035   $a(PQKBManifestationID)11212806
035   $a(PQKBTitleCode)TC0000323283
035   $a(PQKBWorkID)10296647
035   $a(PQKB)10206255
035   $a(DE-He213)978-3-540-46612-3
035   $a(PPN)155170732
035   $a(EXLCZ)991000000000233752
100   $a20121227d1991      u|             0
101 0 $aeng
135   $aurnn#--8mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFoundations of Software Technology and Theoretical Computer Science$b[electronic resource] $e11th Conference, New Delhi, India, December 17-19, 1991. Proceedings /$fedited by Somenath Biswas, Kesav V. Nori
205   $a1st ed. 1991.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991.
215   $a1 online resource (XI, 425 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v560
300   $aBibliographic Level Mode of Issuance: Monograph
311 1 $a3-540-54967-6 
327   $aProgram checking -- Randomizing reductions of search problems -- Time analysis, cost equivalence and program refinement -- AC-equation solving -- On the operational interpretation of complex types -- Tense logics for local reasoning in distributed systems -- Failures semantics for a simple process language with refinement -- Correctness of programs over poor signatures -- Complexity issues for vacillatory function identification -- A purely algebraic proof of McNaughton's theorem on infinite words -- The structure and complexity of minimal NFA's over a unary alphabet -- Relativised cellular automata and complexity classes -- Computing the order of a locally testable automaton -- On the structure and complexity of infinite sets with minimal perfect hash functions -- NP-hard sets and creativeness over constant time languages -- Complete problems involving boolean labelled structures and projection translations --Is BP.?Pa probabilistic class? -- Fast stable in-place sorting with O(n) data moves -- A theorem on the approximation of set cover and vertex cover -- A fast algorithm for the principal partition of a graph -- Uniform circuits and exclusive read PRAMs -- Contracting planar graphs efficiently in parallel -- Fast deterministic selection on mesh-connected processor arrays -- Improved selection in totally monotone arrays -- Designing secure communication protocols from trust specifications -- Computing the shortest path tree in a weak visibility polygon -- Usefulness of angle-sweep over line-sweep -- Petri nets and transition systems (Abstract for an invited talk).
330   $aThis volume contains the proceedings of the Eleventh Conference on Foundations of Software Technology and Theoretical Computer Science held in New Dehli, India December 17-19, 1991. Three invited papers and 25 contributed papers selected from 78 submissions by authors from many different countries reflect the current research concerns of the theoreticalcomputer science community. The topics covered include: -Algorithms (sequential, parallel and geometric) -Automata theory -Functional programming -Learning -Logic of programs -Semantics -Structural complexity theory -Type theory.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v560
606   $aComputers
606   $aSoftware engineering
606   $aComputer logic
606   $aProgramming languages (Electronic computers)
606   $aMathematical logic
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
615  0$aComputers.
615  0$aSoftware engineering.
615  0$aComputer logic.
615  0$aProgramming languages (Electronic computers).
615  0$aMathematical logic.
615 14$aTheory of Computation.
615 24$aSoftware Engineering/Programming and Operating Systems.
615 24$aLogics and Meanings of Programs.
615 24$aComputation by Abstract Devices.
615 24$aProgramming Languages, Compilers, Interpreters.
615 24$aMathematical Logic and Formal Languages.
676   $a004.0151
702   $aBiswas$b Somenath$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aNori$b Kesav V$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465324103316
996   $aFoundations of software technology and theoretical computer science$9383921
997   $aUNISA