Foundations of Software Technology and Theoretical Computer Science : 12th Conference, New Delhi, India, December 18-20, 1992. Proceedings. 1st ed. 1992

種類:

電子ブック

責任表示:

edited by Rudrapatna Shyamasundar

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992

著者名:

• Shyamasundar, Rudrapatna.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 652

ISBN:

9783540475071 [3540475079]    

注記:

System specification and refinement in temporal logic -- Fixed points of Büchi automata -- An automata-theoretic decision procedure for Future Interval Logic -- Improving the results of static analyses of programs by local decreasing iterations -- Implicit point location in arrangements of line segments, with an application to motion planning -- An optimal algorithm for the intersection radius of a set of convex polygons -- C-sensitive triangulations approximate the minmax length triangulation -- Superpolynomial circuits, almost sparse oracles and the exponential hierarchy -- Structural average case complexity -- On bounded truth-table, conjunctive, and randomized reductions to sparse sets -- One-way functions and isomorphism conjecture -- Solving the Lagrangian dual when the number of constraints is fixed -- Superfiniteness of query answers in deductive databases: An automata-theoretic approach -- Proving polynomials positive -- An abstract interpretation scheme for groundness, freeness, and sharing analysis
For more than a decade, Foundations of Software Technology and Theoretical Computer Science Conferences have been providing an annual academic computerscience forum for the presentation of new results in the topics of current research in India and abroad. This year, there was a total of 125 papers from 14 countries. Each paper was reviewed by at least three reviewers; based on these reviews, the programme committee selected 28 papers at a meeting held in July 1992 at the Tata Institute of Fundamental Research, Bombay. The selected papers are included in this volume, together with three invited papers: "Games and full completeness for multiplicative linear logic" by S. Abramsky, "Recent developments inalgorithms for the maximum-flow problem" by K. Melhorn, and "System specification and refinement in temporal logic" by A. Pnueli.

ローカル注記:

学内専用E-BOOKS (local access only)