( en | de | ru )

 

Disambiguation of "Toda, Seinosuke"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.

, , and . Theor. Comput. Sci., 304 (1-3): 129-156 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ekaterina Todadze

 

Other publications of authors with the same name

Restricted Relativizations of Probablistic Polynomial Time.. Theor. Comput. Sci., 93 (2): 265-277 (1992)Space-Efficient Recognition of Sparse Self-Reducible Languages., , and . Comput. Complex., (1994)PP is as Hard as the Polynomial-Time Hierarchy.. SIAM J. Comput., 20 (5): 865-877 (1991)Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs., , and . Discret. Appl. Math., 145 (3): 479-482 (2005)Simple Characterizations of P(#P) and Complete Problems.. J. Comput. Syst. Sci., 49 (1): 1-17 (1994)The Complexity of Finding Medians. FOCS, page 778-787. IEEE Computer Society, (1990)0-8186-2082-X.Relating Complete and Partial Solution for Problems Similar to Graph Automorphism., and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 584-595. Springer, (2007)On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets.. Math. Syst. Theory, 24 (2): 68-82 (1991)The Complexity of Selecting Maximal Solutions, and . Inf. Comput., 119 (2): 231-239 (June 1995)Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy., and . SIAM J. Comput., 21 (2): 316-328 (1992)