Information and Systems-Theoretical Foundations of Computing(Date:2004/12/03)

Presentation
表紙

,  

[Date]2004/12/3
[Paper #]
目次

,  

[Date]2004/12/3
[Paper #]
String Expression for Recognizable Set

Fumihiko YAMAGUCHI,  Katsunori YAMASAKI,  

[Date]2004/12/3
[Paper #]COMP2004-52
It is NP-complete to find the maximum length of the shortest cycles in Eulerian trails

Shuji JIMBO,  Yasuaki OSIE,  Kosaburo HASHIGUCHI,  

[Date]2004/12/3
[Paper #]COMP2004-53
Another Proof for an Upper Bound of a Local Search Algorithm for 3-SAT

Masaki YAMAMOTO,  

[Date]2004/12/3
[Paper #]COMP2004-54
Fast Enumeration of Frequent Patterns

Takeaki UNO,  

[Date]2004/12/3
[Paper #]COMP2004-55
Interval bigraphs are unit grid intersection graphs

Yota OTACHI,  Koichi YAMAZAKI,  

[Date]2004/12/3
[Paper #]COMP2004-56
Better Simulation of Exponential Threshold Weights by Polynomial Weights

Kazuyuki AMANO,  Akira MARUOKA,  

[Date]2004/12/3
[Paper #]COMP2004-57
A Quantum Algorithm for Counting String Pattern Occurrences Approximately

Takenori KOBAYASHI,  Hirotaka ONO,  Kunihiko SADAKANE,  Masafumi YAMASHITA,  

[Date]2004/12/3
[Paper #]COMP2004-58
Constructions of Cluttered Orderings for the Complete Bipartite Graph to speed up RAID

Tomoko ADACHI,  

[Date]2004/12/3
[Paper #]COMP2004-59
複写される方へ

,  

[Date]2004/12/3
[Paper #]
奥付

,  

[Date]2004/12/3
[Paper #]