スポンサーリンク
Department of Informatics, Kyushu University | 論文
- NPN-Representatives of a Set of Optimal Boolean Formulas
- Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
- Speeding Up String Pattern Matching by Text Compression: The Dawn of a New Era (特集 〔情報処理学会〕創立40周年記念論文)
- Refutability and Reliability for Inductive Inference of Recursive Real-Valued Functions
- Learning pattern languages using queries
- Counting and Verifying Maximal Palindromes
- A Flexible User-centric Resource Scheduling Algorithm
- Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
- Criteria for Inductive Inference with Mind Changes and Anomalies of Recursive Real-Valued Functions (Special Issue on Selected Papers from LA Symposium)
- NPN-Representatives of a Set of Optimal Boolean Formulas
- D-031 Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
- Crispness and Representation Theorem in Dedekind Categories
- An Efficient Prover for Elementary Formal Systems
- Knowledge Acquisition from Amino Sequences by Machine Learning System BONSAI
- Efficient Substructure Discovery from Large Semi-Structured Data(Data Mining)
- Variable Length Don't-Care Pattern Matching Problems on Compressed Texts
- DS-1-2 On Formula Size Lower Bounds for Synthesis of Boolean Functions over Disjoint Sets of Variables
- Relaxing Constraints due to Data and Control Dependences
- Counting and Verifying Maximal Palindromes
- The Computational Complexity of Hereditary Elementary Formal Systems