Information and Systems-Theoretical Foundations of Computing(Date:1995/07/27)

Presentation
表紙

,  

[Date]1995/7/27
[Paper #]
目次

,  

[Date]1995/7/27
[Paper #]
An approach to acquisition of natural evidence for some graph problems

Koichi Yamazaki,  

[Date]1995/7/27
[Paper #]
Learning of an NLC Like Graph Grammars

Sei'ichi Tani,  Koichi Yamazaki,  

[Date]1995/7/27
[Paper #]
On the Automorphism Group of a Factor Automaton

Kenji Uemura,  

[Date]1995/7/27
[Paper #]
Similarity and order of logic functions

Shouji Sakamoto,  Youichi Kobuchi,  

[Date]1995/7/27
[Paper #]
Inner-Core and Outer-Core Functions of Partially Defined Boolean Functions

Kazuhisa Makino,  Toshihide Ibaraki,  

[Date]1995/7/27
[Paper #]
Some Difference between Addition and Multiplication on Circuit Complexity

Tatsuie Tsukiji,  

[Date]1995/7/27
[Paper #]
The Complexity of Counting the Number of Optimal Strategies for Two-Person Games Under Uncertainty

Akio Yanbe,  Kouichi Sakurai,  

[Date]1995/7/27
[Paper #]
NC Approximation of Maximum Induced-Subgraph Problems on Sparse Graphs

Zhi-Zhong Chen,  

[Date]1995/7/27
[Paper #]
Computation of the Tutte Polynomial and BDD

Kyoko Sekine,  Hiroshi Imai,  Seiichiro Tani,  

[Date]1995/7/27
[Paper #]
[OTHERS]

,  

[Date]1995/7/27
[Paper #]