DSpace Kyoto University
Japanese | English 

Kyoto University Research Information Repository >

Search Results


Results 1-10 of 24.

Item hits:

Logarithmic truth-table reductions and minimum sizes of forcing conditions : preliminary draft (Proof Theory and Computation Theory)
  Kumabe, Masahiro, Suzuki, Toshio, Yamazaki, Takeshi (2005-07)
  数理解析研究所講究録, 1442: 42-47
file type icon 
Truth-table reductions and minimum sizes of forcing conditions : preliminary draft(Proof Theory of Arithmetic)
  Kumabe, Masahiro, Suzuki, Toshio, Yamazaki, Takeshi (2007-02)
  数理解析研究所講究録, 1533: 8-14
file type icon 
Logspace Bounded Alternation and Logical Query Programs
  OKABE, Yasuo, TSUDA, Takao (1992-06)
  数理解析研究所講究録, 790: 269-275
file type icon 
Learning of Elementary Formal Systems with Two Clauses using Queries and Their Languages(New Trends in Theory of Computation and Algorithm)
  Kato, Hirotaka, Matsumoto, Satoshi, Miyahara, Tetsuhiro (2006-05)
  数理解析研究所講究録, 1489: 64-70
file type icon 
Learnability of Subsequence Languages
  MATSUMOTO, Satoshi, SHINOHARA, Ayumi (1996-05)
  数理解析研究所講究録, 950: 250-256
file type icon 
On the role of equivalence queries in learning via queries
  Tani, Seiichi (1991-06)
  数理解析研究所講究録, 754: 25-34
file type icon 
Genome Homology Visualization by Short Similar Substring Enumeration (Acceleration and Visualization of Computation for Enumeration Problems)
  Uno, Takeaki (2009-04)
  数理解析研究所講究録, 1644: 35-43
file type icon 
On Learning A Class of Context-free Languages in Polynomial Time(Complexity Theory and Related Topics)
  YOKOMORI, Takashi (1990-03)
  数理解析研究所講究録, 716: 60-70
file type icon 
On Using Oracles That Compute Values
  Fenner, Stephan, Homer, Steve, Ogiwara, Mitsunori, Selman, Alan L. (1993-04)
  数理解析研究所講究録, 833: 31-41
file type icon 
Learning One-Variable Pattern Languages Very Efficiently
  数理解析研究所講究録, 992: 47-57
file type icon 

1 2 3 next

Export Format: 
Export to RefWorks


Powered by DSpace 3.2.0 and JAIRO Crawler-List version 1.1
All items in KURENAI are protected by original copyright, with all rights reserved, unless otherwise indicated.