Seinosuke TODA


Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size
Seinosuke TODA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/08/01
Vol. E89-D  No. 8  pp. 2388-2401
Type of Manuscript:  INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
Category: 
Keyword: 
chordal graphsimplicial componentautomorphismisomorphismcomputational group theoryalgorithmcomputational complexity
 Summary | Full Text:PDF

Traversing Graphs in Small Space
Seinosuke TODA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3  pp. 392-396
Type of Manuscript:  INVITED SURVEY PAPER
Category: Graph Algorithms
Keyword: 
st-connectivity problemlogarithmic spacegraph algorithmrandomizationcomputational complexity theory
 Summary | Full Text:PDF

Classes of Arithmetic Circuits Capturing the Complexity of Computing the Determinant
Seinosuke TODA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/01/25
Vol. E75-D  No. 1  pp. 116-124
Type of Manuscript:  Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
complexity Theoryarithmetic circuitdeterminant
 Summary | Full Text:PDF

Grammatical Characterizations of P and PSPACE
Zhi-Zhong CHEN Seinosuke TODA 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1990/09/25
Vol. E73-E  No. 9  pp. 1540-1548
Type of Manuscript:  PAPER
Category: Automaton, Language and Theory of Computing
Keyword: 
 Summary | Full Text:PDF