{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:27Z","timestamp":1725490227056},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_12","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"123-134","source":"Crossref","is-referenced-by-count":0,"title":["The Computational Power of a Family of Decision Forests"],"prefix":"10.1007","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[]},{"given":"Tsukuru","family":"Hirosawa","sequence":"additional","affiliation":[]},{"given":"Yusuke","family":"Watanabe","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"12_CR1","unstructured":"A. Amir, R. Beigel, W. Gasarch, \u201cSome Connections between Bounded Query Classes and Non-Uniform Complexity (Long Version)\u201d, Electronic Colloquium on Computational Complexity, Report No. 24, 2000."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"R. Beigel and T. Hirst, \u201cOne Help Bit Doesn\u2019t Help\u201d, Proc. 30th STOC, pp. 124\u2013129, 1998. (See also \u201cOne Help Bit Doesn\u2019t\u201d, Technical Report of Yale University, Department of Computer Science, TR-1118, 1996.)","DOI":"10.1145\/276698.276720"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"J. Cai, \u201cLower Bounds for Constant Depth Circuits in the Presence of Help Bits\u201d, Proc. 30th FOCS, pp. 532\u2013537, 1989.","DOI":"10.1109\/SFCS.1989.63530"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Y. Freund, \u201cBoosting a Weak Learning Algorithm by Majority\u201d, Information and Computation, Vol. 121, No. 2, pp. 256\u2013285, 1995.","journal-title":"Information and Computation"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01200426","volume":"2","author":"M. Goldmann","year":"1992","unstructured":"M. Goldmann, J. H\u00e5stad, A.A. Razborov, \u201cMajority Gates vs. General Weighted Threshold Gates\u201d, Computational Complexity, Vol. 2, pp. 277\u2013300, 1992.","journal-title":"Computational Complexity"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lovasz","year":"1975","unstructured":"L. Lovasz, \u201cOn the Ratio of Optimal Integral and Fractional Covers\u201d, Discrete Mathematics, Vol. 13, pp. 383\u2013390, 1975.","journal-title":"Discrete Mathematics"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"N. Nisan, S. Rudich and M. Saks, \u201cProducts and Help Bits in Decision Trees\u201d, Proc. 35th FOCS, pp. 318\u2013324, 1994.","DOI":"10.1109\/SFCS.1994.365683"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:27:25Z","timestamp":1556803645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}