Tatsuie Tsukiji - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2021

EXPTIME Hardness of an n by n Custodian Capture GameFumitaka Ito, Masahiko Naito, Naoyuki Katabami, Tatsuie Tsukiji. algorithms, 14(3):70, 2021. [doi]

Smoothed Complexity of Learning Disjunctive Normal Forms, Inverting Fourier Transforms, and Verifying Small CircuitsTatsuie Tsukiji. eccc, 28:179, 2021. [doi]

2020

Hardness of Approximation for Langton's Ant on a Twisted TorusTakeo Hagiwara, Tatsuie Tsukiji. algorithms, 13(12):344, 2020. [doi]

2016

Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with ApplicationsZhi-Zhong Chen, Tatsuie Tsukiji, Hiroki Yamada. ieicet, 99-A(6):1050-1058, 2016. [doi]

Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular AutomataTakeo Hagiwara, Tatsuie Tsukiji, Zhi-Zhong Chen. ieicet, 99-A(6):1034-1049, 2016. [doi]

2011

Recognizing the Repeatable Configurations of Time-Reversible Generalized Langton s Ant Is PSPACE-HardTatsuie Tsukiji, Takeo Hagiwara. algorithms, 4(1):1-15, 2011. [doi]

2006

Computing bounded-degree phylogenetic roots of disconnected graphsZhi-Zhong Chen, Tatsuie Tsukiji. jal, 59(2):125-148, 2006. [doi]

Approximated Vertex Cover for Graphs with Perfect MatchingsTomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji. ieicet, 89-D(8):2405-2410, 2006. [doi]

Computing phylogenetic roots with bounded degrees and errors is NP-completeTatsuie Tsukiji, Zhi-Zhong Chen. TCS, 363(1):43-59, 2006. [doi]

2004

2002

The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional ProblemsShin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. mst, 35(4):449-463, 2002. [doi]

Learning of Short Boolean Conjunctions from Negative ExamplesTatsuie Tsukiji, Takashi Tokutani. scjapan, 33(1):1-7, 2002. [doi]

2001

On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional ProblemsShin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. STACS 2001: 51-62 [doi]

A Limit Law for Outputs in Random Recursive CircuitsTatsuie Tsukiji, Hosam M. Mahmoud. algorithmica, 31(3):403-412, 2001. [doi]

2000

On the difference between polynomial-time many-one and truth-table reducibilities on distributional problemsShin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. eccc, 7(81), 2000. [doi]

1999

Finding Relevant Variables in PAC Model with Membership QueriesDavid Guijarro, Jun Tarui, Tatsuie Tsukiji. alt 1999: 313 [doi]

Learning DNF by Approximating Inclusion-Exclusion FormulaeJun Tarui, Tatsuie Tsukiji. cocoon 1999: 215 [doi]

1997

Partial Occam s Razor and its ApplicationsCarlos Domingo, Tatsuie Tsukiji, Osamu Watanabe. ipl, 64(4):179-185, 1997. [doi]

Partial Occam s Razor and Its ApplicationsCarlos Domingo, Tatsuie Tsukiji, Osamu Watanabe. alt 1997: 85-99

1996

On a Small Class of Boolean SumsTatsuie Tsukiji. TCS, 163(1&2):283-289, 1996. [doi]

On the Depth of Randomly Generated CircuitsTatsuie Tsukiji, Fatos Xhafa. esa 1996: 208-220

Sign in or sign up to see more results.

runs on WebDSL