{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:35:32Z","timestamp":1648755332477},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2005,7,6]],"date-time":"2005-07-06T00:00:00Z","timestamp":1120608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2005,8]]},"DOI":"10.1007\/s00153-005-0283-1","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T15:15:08Z","timestamp":1120576508000},"page":"751-762","source":"Crossref","is-referenced-by-count":2,"title":["Bounded truth table does not reduce the one-query tautologies to a random oracle"],"prefix":"10.1007","volume":"44","author":[{"given":"Toshio","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"283_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-16486-3_87","volume":"223","author":"Ambos-Spies","year":"1986","unstructured":"Ambos-Spies, K.: Randomness, relativizations, and polynomial reducibilities. In: Structure in Complexity Theory, A.L. Selman (eds.), Lect. Notes Comput. Sci. 223, 23\u201334, Springer, Berlin, (1986)","journal-title":"In: Structure in Complexity Theory, A.L. Selman (eds.), Lect. Notes Comput. Sci."},{"key":"283_CR2","doi-asserted-by":"crossref","unstructured":"Ambos-Spies, K.: Resource-bounded genericity. In: Computability, enumerability, unsolvability, S.B. Cooper, T.A. Slaman, S.S. Wainer (eds.), London Math. Soc. Lect. Note Series 224, Cambridge University Press, Cambridge, 1996, pp. 1\u201359","DOI":"10.1017\/CBO9780511629167.002"},{"key":"283_CR3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(87)90053-3","volume":"51","author":"Ambos-Spies","year":"1987","unstructured":"Ambos-Spies, K., Fleischhack, H., Huwig, H.: Diagonalizations over polynomial time computable sets. Theoret. Comput. Sci. 51, 177\u2013204 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"283_CR4","unstructured":"Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Complexity, logic, and recursion theory, A. Sorbi (eds.), Lecture Notes in Pure and Applied Mathematics 187, Marcel Dekker, New York, 1997, pp. 1\u201347"},{"key":"283_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(96)89424-2","volume":"168","author":"Ambos-Spies","year":"1996","unstructured":"Ambos-Spies, K., Neis, H., Terwijin, S.A.: Genericity and measure for exponential time. Theoret. Comput. Sci. 168, 3\u201319 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"283_CR6","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural complexity I. Springer, Berlin, 1988","DOI":"10.1007\/978-3-642-97062-7"},{"key":"283_CR7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","volume":"10","author":"Bennett","year":"1981","unstructured":"Bennett, C.H., Gill, J.: Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA with probability 1. SIAM J. Comput. 10, 96\u2013113 (1981)","journal-title":"SIAM J. Comput."},{"key":"283_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90314-R","volume":"81","author":"Book","year":"1991","unstructured":"Book, R.V., Tang S.: Polynomial-time reducibilities and \u201calmost all\u201d oracle sets. Theoret. Comput. Sci. 81, 35\u201347 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"283_CR9","doi-asserted-by":"crossref","unstructured":"Dowd, M.: Generic oracles, uniform machines, and codes. Information and Computation 96, pp. 65\u201376 (1992)","DOI":"10.1016\/0890-5401(92)90055-K"},{"key":"283_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90139-9","volume":"14","author":"Ko","year":"1982","unstructured":"Ko, Ker-I.: Some observations on the probabilistic algorithms and NP-hard problems. Inform. Process. Lett. 14, 39\u201343 (1982)","journal-title":"Inform. Process. Lett."},{"key":"283_CR11","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0019-9958(83)80023-0","volume":"57","author":"Kurtz","year":"1983","unstructured":"Kurtz, S.A.: On the random oracle hypothesis. Inform. Control 57, 40\u201347 (1983), Preliminary version appeared in: Proc. 14th. ann. ACM symp. on theory of computing, Association for Computing Machinery, 1982, pp. 224\u2013230","journal-title":"Inform. Control"},{"key":"283_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"Ladner","year":"1975","unstructured":"Ladner, R.E., Lynch, N.A., Selman, A.L.: A comparison of polynomial time reducibilities. Theoret. Comput. Sci. 1, 103\u2013123 (1975)","journal-title":"Theoret. Comput. Sci."},{"key":"283_CR13","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1002\/1521-3870(200105)47:2<249::AID-MALQ249>3.0.CO;2-N","volume":"47","author":"Merkle","year":"2001","unstructured":"Merkle, W., Wang, Y.: Separations by random oracles and \u201calmost\u201d classes for generalized reducibilities. Math. Logic Quart. 47, 249\u2013269 (2001)","journal-title":"Math. Logic Quart."},{"key":"283_CR14","doi-asserted-by":"crossref","unstructured":"Orponen, P.: Complexity classes of alternating machines with oracles. In: Automata, languages and programming 10th colloquium, J. Diaz (eds.), Lect. Notes Comput. Sci. 154 Springer, Berlin, 1983, pp. 573\u2013584","DOI":"10.1007\/BFb0036938"},{"key":"283_CR15","unstructured":"Rogers, H. Jr.: Theory of recursive functions and effective computability. Massachusetts Institute of Technology, 1987 (Original edition: MacGraw-Hill, New York, 1967)"},{"key":"283_CR16","doi-asserted-by":"crossref","unstructured":"Sacks, G.E.: Degrees of unsolvability. Ann. Math. Studies 55. Princeton university press, Princeton, N.J., 1963","DOI":"10.1515\/9781400881840"},{"key":"283_CR17","doi-asserted-by":"crossref","first-page":"280","DOI":"10.2307\/2964288","volume":"23","author":"Spector","year":"1958","unstructured":"Spector, C: Measure theoretic construction of incomparable hyperdegrees. J. Symbolic Logic 23, 280\u2013288 (1958)","journal-title":"J. Symbolic Logic"},{"key":"283_CR18","first-page":"91","volume":"15","author":"Suzuki","year":"1998","unstructured":"Suzuki, T.: Recognizing tautology by a deterministic algorithm whose while-loop\u2019s execution time is bounded by forcing. Kobe Journal of Mathematics 15, 91\u2013102 (1998)","journal-title":"Kobe Journal of Mathematics"},{"key":"283_CR19","unstructured":"Suzuki, T.: Computational complexity of Boolean formulas with query symbols. Doctoral dissertation, 1999, Institute of Mathematics, University of Tsukuba, Tsukuba-City, Japan"},{"key":"283_CR20","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1305\/ndjfl\/1038234608","volume":"41","author":"Suzuki","year":"2000","unstructured":"Suzuki, T.: Complexity of the r-query tautologies in the presence of a generic oracle. Notre Dame J. Formal Logic 41, 142\u2013151 (2000)","journal-title":"Notre Dame J. Formal Logic"},{"key":"283_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1305\/ndjfl\/1054837938","volume":"42","author":"Suzuki","year":"2001","unstructured":"Suzuki, T.: Forcing complexity: minimum sizes of forcing conditions. Notre Dame J. Formal Logic 42, 117\u2013120 (2001)","journal-title":"Notre Dame J. Formal Logic"},{"key":"283_CR22","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/inco.2002.3149","volume":"176","author":"Suzuki","year":"2002","unstructured":"Suzuki, T.: Degrees of Dowd-type generic oracles. Inform. and Comput. 176, 66\u201387 (2002)","journal-title":"Inform. and Comput."},{"key":"283_CR23","unstructured":"Suzuki, T.: Forcing complexity: degree of randomness shown by minimum sizes of forcing conditions. A talk at Takeuti Symposium (2003), Kobe, Japan"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-005-0283-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-005-0283-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-005-0283-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:33:44Z","timestamp":1586320424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-005-0283-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,6]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,8]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s00153-005-0283-1","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,6]]}}}