Seinosuke Toda

Available identifiers

zbMath Open toda.seinosukeWikidataQ8190500 ScholiaQ8190500MaRDI QIDQ750148

List of research outcomes

Publication	Date of Publication	Type
Colored hypergraph isomorphism is fixed parameter tractable	2015-03-02	Paper
COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable	2012-08-29	Paper
Computational complexity of computing a partial solution for the graph automorphism problems	2009-05-28	Paper
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism	2008-09-17	Paper
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs	2005-02-23	Paper
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4779175	2002-11-25	Paper
Simple characterizations of \(P(\# P)\) and complete problems	2000-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q4938656	2000-07-20	Paper
https://portal.mardi4nfdi.de/entity/Q4942650	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4937194	2000-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4703465	1999-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q4703655	1999-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q4253333	1999-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4246733	1999-06-15	Paper
On sets bounded truth-table reducible to $P$-selective sets	1997-04-13	Paper
On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)	1997-03-31	Paper
On the power of generalized Mod-classes	1996-07-01	Paper
The complexity of selecting maximal solutions	1995-08-02	Paper
On closure properties of GapP	1995-05-14	Paper
Space-efficient recognition of sparse self-reducible languages	1995-05-14	Paper
Structural analysis of the complexity of inverse functions	1993-05-17	Paper
Turing machines with few accepting computations and low sets for PP	1992-09-27	Paper
Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P	1992-09-27	Paper
ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS	1992-09-27	Paper
Restricted relativizations of probabilistic polynomial time	1992-06-28	Paper
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy	1992-06-28	Paper
On polynomial-time truth-table reducibility of intractable sets to P-selective sets	1991-01-01	Paper
PP is as Hard as the Polynomial-Time Hierarchy	1991-01-01	Paper
On the complexity of topological sorting	1990-01-01	Paper
Positive relativizations for log space computability	1990-01-01	Paper
\(\Sigma_ 2SPACE(n)\) is closed under complement	1987-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Seinosuke Toda