On ACC. Zbl 0835.68040
Beigel, Richard; Tarui, Jun |
|
1994
|
Depth-first search using \(O(n)\) bits. Zbl 1430.68172
Asano, Tetsuo; Izumi, Taisuke; Kiyomi, Masashi; Konagaya, Matsuo; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun; Uehara, Ryuhei |
|
2014
|
Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy. Zbl 0783.68047
Tarui, Jun |
|
1993
|
Randomized polynomials, threshold circuits, and the polynomial hierarchy. Zbl 0764.94026
Tarui, Jun |
|
1991
|
On permutations with limited independence. Zbl 0953.68107
Itoh, Toshiya; Takei, Yoshinori; Tarui, Jun |
|
2000
|
Learning DNF by approximating inclusion-exclusion formulae. Zbl 0951.68519
Tarui, Jun; Tsukiji, Tatsuie |
|
1999
|
The asymptotic complexity of merging networks. Zbl 0882.68065
Miltersen, Peter Bro; Paterson, Mike; Tarui, Jun |
|
1996
|
On probabilistic ACC circuits with an exact-threshold output gate. Zbl 0925.94110
Beigel, Richard; Tarui, Jun; Toda, Seinosuke |
|
1992
|
Finding relevant variables in PAC model with membership queries. Zbl 0955.68094
Guijarro, David; Tarui, Jun; Tsukiji, Tatsuie |
|
1999
|
A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds. Zbl 1217.68103
Amano, Kazuyuki; Tarui, Jun |
|
2011
|
On the negation-limited circuit complexity of merging. Zbl 1011.68040
Amano, Kazuyuki; Maruoka, Akira; Tarui, Jun |
|
2003
|
On the sample size of \(k\)-restricted min-wise independent permutations and other distributions. Zbl 1192.68460
Itoh, Toshiya; Takei, Yoshinori; Tarui, Jun |
|
2003
|
On the minimum number of completely 3-scrambling permutations. Zbl 1137.05004
Tarui, Jun |
|
2008
|
Computing symmetric functions with AND/OR circuits and a single MAJORITY gate. Zbl 0796.94020
Zhang, Zhi-Li; Barrington, David A. Mix; Tarui, Jun |
|
1993
|
Space-efficient algorithms for longest increasing subsequence. Zbl 1487.68261
Kiyomi, Masashi; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun |
|
2018
|
Learning Boolean functions in \(AC^{0}\) on attribute and classification noise. Zbl 1110.68403
Miyata, Akinobu; Tarui, Jun; Tomita, Etsuji |
|
2004
|
Negation-limited complexity of parity and inverters. Zbl 1135.68429
Iwama, Kazuo; Morizumi, Hiroki; Tarui, Jun |
|
2006
|
A nearly linear size \(4\)-min-wise independent permutation family by finite geometries. Zbl 1279.68276
Tarui, Jun; Itoh, Toshiya; Takei, Yoshinori |
|
2003
|
The asymptotic complexity of merging networks. Zbl 0977.68876
Miltersen, Peter Bro; Paterson, Mike; Tarui, Jun |
|
1992
|
Smallest formulas for parity of \(2^{k }\) variables are essentially unique. Zbl 1148.68373
Tarui, Jun |
|
2008
|
Space-efficient algorithms for longest increasing subsequence. Zbl 1433.68632
Kiyomi, Masashi; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun |
|
2020
|
Smallest formulas for the parity of \(2^k\) variables are essentially unique. Zbl 1344.68081
Tarui, Jun |
|
2010
|
Reductions for monotone Boolean circuits. Zbl 1151.94014
Iwama, Kazuo; Morizumi, Hiroki; Tarui, Jun |
|
2008
|
Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences. Zbl 1200.94067
Morizumi, Hiroki; Tarui, Jun |
|
2007
|
Space-efficient algorithms for longest increasing subsequence. Zbl 1433.68632
Kiyomi, Masashi; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun |
|
2020
|
Space-efficient algorithms for longest increasing subsequence. Zbl 1487.68261
Kiyomi, Masashi; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun |
|
2018
|
Depth-first search using \(O(n)\) bits. Zbl 1430.68172
Asano, Tetsuo; Izumi, Taisuke; Kiyomi, Masashi; Konagaya, Matsuo; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun; Uehara, Ryuhei |
|
2014
|
A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds. Zbl 1217.68103
Amano, Kazuyuki; Tarui, Jun |
|
2011
|
Smallest formulas for the parity of \(2^k\) variables are essentially unique. Zbl 1344.68081
Tarui, Jun |
|
2010
|
On the minimum number of completely 3-scrambling permutations. Zbl 1137.05004
Tarui, Jun |
|
2008
|
Smallest formulas for parity of \(2^{k }\) variables are essentially unique. Zbl 1148.68373
Tarui, Jun |
|
2008
|
Reductions for monotone Boolean circuits. Zbl 1151.94014
Iwama, Kazuo; Morizumi, Hiroki; Tarui, Jun |
|
2008
|
Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences. Zbl 1200.94067
Morizumi, Hiroki; Tarui, Jun |
|
2007
|
Negation-limited complexity of parity and inverters. Zbl 1135.68429
Iwama, Kazuo; Morizumi, Hiroki; Tarui, Jun |
|
2006
|
Learning Boolean functions in \(AC^{0}\) on attribute and classification noise. Zbl 1110.68403
Miyata, Akinobu; Tarui, Jun; Tomita, Etsuji |
|
2004
|
On the negation-limited circuit complexity of merging. Zbl 1011.68040
Amano, Kazuyuki; Maruoka, Akira; Tarui, Jun |
|
2003
|
On the sample size of \(k\)-restricted min-wise independent permutations and other distributions. Zbl 1192.68460
Itoh, Toshiya; Takei, Yoshinori; Tarui, Jun |
|
2003
|
A nearly linear size \(4\)-min-wise independent permutation family by finite geometries. Zbl 1279.68276
Tarui, Jun; Itoh, Toshiya; Takei, Yoshinori |
|
2003
|
On permutations with limited independence. Zbl 0953.68107
Itoh, Toshiya; Takei, Yoshinori; Tarui, Jun |
|
2000
|
Learning DNF by approximating inclusion-exclusion formulae. Zbl 0951.68519
Tarui, Jun; Tsukiji, Tatsuie |
|
1999
|
Finding relevant variables in PAC model with membership queries. Zbl 0955.68094
Guijarro, David; Tarui, Jun; Tsukiji, Tatsuie |
|
1999
|
The asymptotic complexity of merging networks. Zbl 0882.68065
Miltersen, Peter Bro; Paterson, Mike; Tarui, Jun |
|
1996
|
On ACC. Zbl 0835.68040
Beigel, Richard; Tarui, Jun |
|
1994
|
Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy. Zbl 0783.68047
Tarui, Jun |
|
1993
|
Computing symmetric functions with AND/OR circuits and a single MAJORITY gate. Zbl 0796.94020
Zhang, Zhi-Li; Barrington, David A. Mix; Tarui, Jun |
|
1993
|
On probabilistic ACC circuits with an exact-threshold output gate. Zbl 0925.94110
Beigel, Richard; Tarui, Jun; Toda, Seinosuke |
|
1992
|
The asymptotic complexity of merging networks. Zbl 0977.68876
Miltersen, Peter Bro; Paterson, Mike; Tarui, Jun |
|
1992
|
Randomized polynomials, threshold circuits, and the polynomial hierarchy. Zbl 0764.94026
Tarui, Jun |
|
1991
|