Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Toda, Seinosuke"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Colored hypergraph isomorphism is fixed parameter tractable
V. Arvind
,
Bireswar Das
,
Johannes Köbler
,
Seinosuke Toda
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 327-337
Computational complexity of computing a partial solution for the Graph Automorphism problems
Takayuki Nagoya
,
Seinosuke Toda
Theoretical Computer Science
410
(21-23), 2009, pp. 2064-2071
Relating complete and partial solution for problems similar to graph automorphism
Takayuki Nagoya
,
Seinosuke Toda
Lecture Notes in Computer Science
4708
, 2007, pp. 584-595
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Maciej Liśkiewicz
,
Mitsunori Ogihara
,
Seinosuke Toda
Theoretical Computer Science
304
(1-3), 2003, pp. 129-156
The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs
Mitsunori Ogihara
,
Seinosuke Toda
Lecture Notes in Computer Science
2136
, 2001, pp. 585-597
The complexity of computing the number of self-avoiding walks
Mitsunori Ogihara
,
Seinosuke Toda
Technical Report (TR01-061), 2001
Some observations on the computational complexity of graph accessibility problem
Jun Tarui
,
Seinosuke Toda
Lecture Notes in Computer Science
1627
, 1999, pp. 18-30
Graph isomorphism: Its complexity and algorithms
Seinosuke Toda
Lecture Notes in Computer Science
1738
, 1999, pp. 341-341
On clusure properties of
\#\P
in the context of
PF\circ\#\P
Mitsunori Ogihara
,
Thomas Thierauf
,
Seinosuke Toda
,
Osamu Watanabe
Journal of Computer and System Sciences
53
(2), 1996, pp. 171-179
The complexity of selecting maximal solutions
Zhi-Zhong Chen
,
Seinosuke Toda
Information and Computation
119
(2), 1995, pp. 231-239
On sets bounded truth-table reducible to P-selective sets
Thomas Thierauf
,
Seinosuke Toda
,
Osamu Watanabe
Lecture Notes in Computer Science
775
, 1994, pp. 427-438
Simple characterizations of
P(\#P)
and complete problems
Seinosuke Toda
Journal of Computer and System Sciences
49
(1), 1994, pp. 1-17
The complexity of selecting maximal solutions
Zhi-Zhong Chen
,
Seinosuke Toda
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 313-325
On the power of generalized MOD-classes
Johannes Köbler
,
Seinosuke Toda
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 147-155
On closure properties of
\#P
in the context of
PF\circ\#P
Mitsunori Ogiwara
,
Thomas Thierauf
,
Seinosuke Toda
,
Osamu Watanabe
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 139-146
Structural analysis of the complexity of inverse functions
Osamu Watanabe
,
Seinosuke Toda
Math. Systems Theory
26
, 1993, pp. 203-214
On probabilistic ACC circuits with an exact-threshold output gate
Richard Beigel
,
Jun Tarui
,
Seinosuke Toda
Lecture Notes in Computer Science
650
, 1992, pp. 420-429
Turing machines with few accepting computations and low sets for PP
Johannes Köbler
,
Uwe Schöning
,
Seinosuke Toda
,
Jacobo Torán
Journal of Computer and System Sciences
44
, 1992, pp. 272-286
Counting classes are at least as hard as the polynomial-time hierarchy
Seinosuke Toda
,
Mitsunori Ogiwara
SIAM Journal on Computing
21
(2), 1992, April, pp. 316-328
Polynomial-time 1-Turing reductions from \#PH to \#P
Seinosuke Toda
,
Osamu Watanabe
Theoretical Computer Science
100
, 1992, pp. 205-221
Restricted relativizations of probabilistic polynomial time
Seinosuke Toda
Theoretical Computer Science
93
, 1992, pp. 265-277
On the complexity of computing optimal solutions
Zhi-Zhong Chen
,
Seinosuke Toda
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 207-220
Counting classes are at least as hard as the polynomial-time hierarchy
Seinosuke Toda
,
Mitsunori Ogiwara
Proceedings of the 6th Annual Conference on Structure in Complexity Theory, CSCT'91 (Chicago, Illinois, June 30-July 3, 1991)
, 1991, pp. 2-12
PP is as hard as the polynomial-time hierarchy
Seinosuke Toda
SIAM Journal on Computing
20
(5), 1991, October, pp. 865-877
On polynomial-time truth-table reducibility of intractable sets to
P
-selective sets
Seinosuke Toda
Math. Systems Theory
24
, 1991, pp. 69-82
Seiten 1
2
>