P. B. Miltersen, N.V. Vinodchadran, and O. Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. In T. Asano, H. Imai, D.T. Lee, S. Nakano, and T. Tokuyama, editors, Proceedings of the Fifth Annual International Conference on Computing and Combinatorics, Verlag, 1999. (COCOON'99). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Super-Polynomial versus Half-Exponential Circuit Size.. - Miltersen, Variyam.. (1999) (3 citations) Self-citation (Miltersen Vinodchandran Watanabe) (Correct)
....property to hold among these classes of functions. Let #, # rationals. Then for f exp # and g exp # , we would like f(g( to be in exp # # . There exist solutions for Equation 1 which give rise to functions with this property. The one due to Szekeres [16] is an example (please refer to [15] for a proof this) We use this property in many of our proofs, often with out making any explicite reference to it. Time constructibility of these functions is a more subtle issue. In [13] the authors give a numerical procedure for approximating e # (x) We strongly believe that a rigorous ....
P. B. Miltersen, N. V. Vinodchandran and O. Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. Research Report c-130, Dept. of Math. and Comput. Sc., Tokyo Inst. of Tech. Available at http://www.is.titech.ac.jp/research/research-report/C/, 1999.
Super-Polynomial versus Half-Exponential Circuit.. - Miltersen.. (1999) (3 citations) Self-citation (Miltersen Vinodchandran Watanabe) (Correct)
....property to hold among these classes of functions. Let ; rationals. Then for f 2 exp and g 2 exp , we would like f(g( to be in exp . There exist solutions for Equation 1 which give rise to functions with this property. The one due to Szekeres [16] is an example (please refer to [15] for a proof this) We use this property in many of our proofs, often with out making any explicite reference to it. Time constructibility of these functions is a more subtle issue. In [13] the authors give a numerical procedure for approximating e (x) We strongly believe that a rigorous ....
P. B. Miltersen, N. V. Vinodchandran and O. Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. Research Report c-130, Dept. of Math. and Comput. Sc., Tokyo Inst. of Tech. Available at http://www.is.titech.ac.jp/research/research-report/C/, 1999.
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
No context found.
P. B. Miltersen, N.V. Vinodchadran, and O. Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. In T. Asano, H. Imai, D.T. Lee, S. Nakano, and T. Tokuyama, editors, Proceedings of the Fifth Annual International Conference on Computing and Combinatorics, Verlag, 1999. (COCOON'99).
Pseudorandomness and Average-case Complexity via Uniform.. - Trevisan, Vadhan (2002) (5 citations) (Correct)
No context found.
P. B. Miltersen, N. V. Vinodchandran, and O. Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. In Computing and combinatorics (Tokyo, 1999.
Is P versus NP Formally Independent? - Aaronson (Correct)
No context found.
P. B. Miltersen, N. V. Vinodchandran, and O. Watanabe. Super-polynomial versus halfexponential circuit size in the exponential hierarchy, in Proceedings of COCOON'1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC