Matches in Harvard for { <http://id.lib.harvard.edu/aleph/002475152/catalog> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- catalog contributor b3569794.
- catalog contributor b3569795.
- catalog created "c1991.".
- catalog date "1991".
- catalog date "c1991.".
- catalog dateCopyrighted "c1991.".
- catalog description "Includes bibliographical references.".
- catalog description "Is BP.@P a probabililstic class? -- Fast stable in-place sorting with O(n) data moves -- Theorem on the approximation of set cover and vertex cover -- 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.".
- catalog description "Program 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 reasong in distributed systems -- Failures semantics for a simple process language with refinement -- Correctness of programs over poor signatures -- Complexity issues for vacillatory function identification -- Purely algebraic proof of McNaughton's Theorem on infinite words -- Structure and complexity of minimal NFAs 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 project translations.".
- catalog extent "x, 419 p. :".
- catalog identifier "0387549676 (New York)".
- catalog identifier "3540549676 (Berlin)".
- catalog isPartOf "Lecture notes in computer science ; 560".
- catalog issued "1991".
- catalog issued "c1991.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer-Verlag,".
- catalog subject "005 20".
- catalog subject "Computer science Congresses.".
- catalog subject "Computer software Congresses.".
- catalog subject "QA76.751 .F68 1991".
- catalog tableOfContents "Is BP.@P a probabililstic class? -- Fast stable in-place sorting with O(n) data moves -- Theorem on the approximation of set cover and vertex cover -- 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.".
- catalog tableOfContents "Program 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 reasong in distributed systems -- Failures semantics for a simple process language with refinement -- Correctness of programs over poor signatures -- Complexity issues for vacillatory function identification -- Purely algebraic proof of McNaughton's Theorem on infinite words -- Structure and complexity of minimal NFAs 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 project translations.".
- catalog title "Foundations of software technology and theoretical computer science : 11th conference, New Delhi, India, December 17-19, 1991 : proceedings / S. Biswas, K.V. Nori (eds.).".
- catalog type "text".