rick@cs.arizona.edu (Rick Schlichting) (03/13/91)
------------------------------------------ Research Reports on Information Sciences Series C:Computer Science Department of Information Sciences Tokyo Institute of Technology O-Okayama, Meguro-ku, Tokyo 152 Japan ------------------------------------------ C-70. Osamu Watanabe<1985> On Herd One-Way Functions. C-71. Hirofumi Yokouchi<1985> Application and Composition in Functional Programming. C-72. Masa-aki Izumi<1985> Qualitative Relativization of Problems about Low Level Space Bounded Complexety C-73. Tetsuo Moriya<1985> Some Classes of Infinite-Tree Languages<ll>. C-74. Ronald Book, Pekka Orponen, David Russo & Osamu Watanabe<1986> On exponential lowness. C-75. Akinori Yonezava, Etsuya Shibayama, Toshihiro Takada & Yasuaki Honda <1986> Modelling and Programming in an Object-Oriented Concurrent Programming Language ABCL/1 C-76. Etsuya Shibayama & Akinori Yonezawa <1986> Distributed Computing in ABCL/1 C-77. Masako Takahashi<1986> Brzozouski Hierarchy of w-languages. C-78. Kojiro Kobayashi<1986> On the Probability that a Randomly Selected Set is NP-Hard. C-79. Osamu Watanabe<1986> Some Observations on k-Creative Sets. C-80. Kazuyuki Tanaks<l986> A Recursion-Theoretic Proof of Hausdorff' s Theorem on Ambiguous Borel Sets C-81. Yasuhiko Yoshinaga<l987> POWER DOMAINS-Topological Characterizations and Retract Theorem C-82. Masako Takahashi<1987> Parallel Reductions in lambda-calculus C-83. Satoshi Menju<1987> The Stable Marriage Assignment and Related Problems C-84. Hiroto Inaba<1987>. On Weakly Continuous lamba-models C-85. Kentaro Kizaki<1987> A Note on Zero-Knowledge Proof for the Discrete Logarithm Problem C-86. Kazuyuki Tanaka<l987> Ramsey Theorem and Set Existence Axioms C-87. Akinori Yonezawa & Ichiro 0hsawa<1987> A New Approach to Parallel Parsing for Context- Free Grammars C-88. Mitsunori 0giwara<l987> A Primality Criteria Based on an Improvement of Lenstra's Residue Class Algorithm C-89. Masa-aki Izumi & Kojiro Kobayashi <1988> A Note on Collapsing Bounded Query Classes C-9O. Masa-aki Izumi<1988> Relativizing the P=?NP problem with restricted oracles C-91. Masako Takahashi <1989> On Unsolvable Lamba-Terms C-92. Ichiro Ohsawa & Akinori Yonezawa<l989> A Computational Model of an lntelligent Agent who Talke with a Person C-93. Mitsunori Ogiwara<1989> A Method for Generating CryptographicaIly Strong Primes C-94. Mitsunori Ogiwara<l989> Paddable Sets in Number Theory C-95. Mitsunori Ogiwara & Osamu Watanabe <1989> On Polynomial Bounded Truth-Table Rellucibility of NP Sets to Sparse Sets C-96. Kojiro Kobayashi & Hitoshi Iwamoto <1990> Worst-Case Analysis of Ziv-Lempel Information Compression Algorithm C-97. Kazuyuki Tanaka<l99O> A game-theoretic proof of analytic Ramseyness C-98. Mitsunori Ogiwara & Antoni Lozano<199O> On One Word-Decreasing Self- Reducible Sets C-99. Mitsunori Ogiwawa & Lane A. Heniachandra<l990> A Complexity Theory for Closure Properties C-1O0. Ryo Kashima<1991> Cut-Elimination Theorem for the Intermediate Logic CD C-101. Mitsunori Ogiwara<1991> Characterizing Low Levels of the Polynomial-Time Hierarchy Relative to C=P via Metric Turing Machines