Seinosuke Toda

From MaRDI portal
Person:750148

Available identifiers

zbMath Open toda.seinosukeDBLP44/6887WikidataQ8190500 ScholiaQ8190500MaRDI QIDQ6482543

List of research outcomes





PublicationDate of PublicationType
Colored hypergraph isomorphism is fixed parameter tractable2015-03-02Paper
Colored hypergraph isomorphism is fixed parameter tractable2012-08-29Paper
Computational complexity of computing a partial solution for the graph automorphism problems2009-05-28Paper
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism2008-09-17Paper
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs2005-02-23Paper
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47791752002-11-25Paper
Simple characterizations of \(P(\# P)\) and complete problems2000-08-14Paper
https://portal.mardi4nfdi.de/entity/Q49386562000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q49426502000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49371942000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q47034651999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47036551999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q42533331999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42467331999-06-15Paper
On sets bounded truth-table reducible to $P$-selective sets1997-04-13Paper
On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)1997-03-31Paper
On the power of generalized Mod-classes1996-07-01Paper
The complexity of selecting maximal solutions1995-08-02Paper
Space-efficient recognition of sparse self-reducible languages1995-05-14Paper
On closure properties of GapP1995-05-14Paper
Structural analysis of the complexity of inverse functions1993-05-17Paper
Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P1992-09-27Paper
ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS1992-09-27Paper
Turing machines with few accepting computations and low sets for PP1992-09-27Paper
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy1992-06-28Paper
Restricted relativizations of probabilistic polynomial time1992-06-28Paper
On polynomial-time truth-table reducibility of intractable sets to P-selective sets1991-01-01Paper
PP is as Hard as the Polynomial-Time Hierarchy1991-01-01Paper
On the complexity of topological sorting1990-01-01Paper
Positive relativizations for log space computability1990-01-01Paper
\(\Sigma_ 2SPACE(n)\) is closed under complement1987-01-01Paper

Research outcomes over time

This page was built for person: Seinosuke Toda