Tatsuie Tsukiji

Available identifiers

zbMath Open tsukiji.tatsuieMaRDI QIDQ671371

List of research outcomes

Publication	Date of Publication	Type
Recognizing the repeatable configurations of time-reversible generalized Langton's ant is PSPACE-hard	2019-03-26	Paper
On the depth of randomly generated circuits	2017-12-05	Paper
Computing phylogenetic roots with bounded degrees and errors is NP-complete	2007-01-09	Paper
Computing bounded-degree phylogenetic roots of disconnected graphs	2006-06-30	Paper
Graph-Theoretic Concepts in Computer Science	2005-12-08	Paper
Computing and Combinatorics	2005-06-15	Paper
Computing and Combinatorics	2005-06-15	Paper
Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees	2005-02-09	Paper
The difference between polynomial-time many-one and truth-table reducibilities on distributional problems	2002-12-01	Paper
On the internal structure of random recursive circuits	2002-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q2762496	2002-01-09	Paper
On the PSPACE difficulty of generalized checkmate in chess	2001-09-17	Paper
On the difference between 2-tt reductions and many-one reductions in the average complexity of computations	2001-09-17	Paper
Counterexample learning for monotone monomials of length \(O(\log n)\)	2001-09-17	Paper
https://portal.mardi4nfdi.de/entity/Q4505382	2000-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4955321	2000-07-24	Paper
https://portal.mardi4nfdi.de/entity/Q4937845	2000-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q4703651	1999-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q4703854	1999-12-01	Paper
Partial Occam's Razor and its applications	1998-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4370217	1998-01-14	Paper
On a small class of Boolean sums	1997-02-27	Paper

Research outcomes over time

This page was built for person: Tatsuie Tsukiji