Information and Systems-Theoretical Foundations of Computing(Date:1995/09/22)

Presentation
表紙

,  

[Date]1995/9/22
[Paper #]
目次

,  

[Date]1995/9/22
[Paper #]
Polynomial Time Algorithm for Testing Self-Duality and its Applications to Learning

Carlos Domingo,  

[Date]1995/9/22
[Paper #]COMP95-41
Complexity Classes Characterizeed by many Computation Paths

Ryuhei Uehara,  

[Date]1995/9/22
[Paper #]COMP95-42
Time Complexity Hierarchies of Parallel TMs with the Random Access Facility

Chuzo IWAMOTO,  Kazuo IWAMA,  

[Date]1995/9/22
[Paper #]COMP95-43
Randomized Approximation of Constraint Satisfaction and Stable Cut

Hoong-Chuin LAU,  

[Date]1995/9/22
[Paper #]COMP95-44
Finding Two Arc Disjoint Paths in Eulerian Digraphs

Andras FRANK,  Toshihide IBARAKI,  Hitoshi NAGAMOCHI,  

[Date]1995/9/22
[Paper #]COMP95-45
Generalized k-edge-partition problem with specified bases

Hiroshi NAGAMOCHI,  Toshimasa ISHII,  Toshihide IBARAKI,  

[Date]1995/9/22
[Paper #]COMP95-46
[OTHERS]

,  

[Date]1995/9/22
[Paper #]