{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:36:57Z","timestamp":1649032617940},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(99)00142-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:38:29Z","timestamp":1027636709000},"page":"477-482","source":"Crossref","is-referenced-by-count":2,"title":["No feasible monotone interpolation for simple combinatorial reasoning"],"prefix":"10.1016","volume":"238","author":[{"given":"Noriko H.","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00142-5_BIB1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0304-3975(96)80704-3","article-title":"1Tractability of cut-free Gentzen type propositional calculus with permutation inference","volume":"170","author":"Arai","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00142-5_BIB2","doi-asserted-by":"crossref","unstructured":"N.H. Arai, Tractability of cut-free Gentzen type propositional calculus with permutation inference II, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(98)00186-8"},{"key":"10.1016\/S0304-3975(99)00142-5_BIB3","series-title":"Combinatorics, Computation & Logic\u201999","first-page":"106","article-title":"No feasible monotone interpolation for cut-free Gentzen type propositional calculus with permutation inference","author":"Arai","year":"1999"},{"key":"10.1016\/S0304-3975(99)00142-5_BIB4","doi-asserted-by":"crossref","unstructured":"M. Bonet, T. Pitassi, R. Raz, Lower bounds for cutting planes proofs with small coefficients, Proc. ACM Symp. Theory of Computing, 1995, pp. 575\u2013584.","DOI":"10.1145\/225058.225275"},{"key":"10.1016\/S0304-3975(99)00142-5_BIB5","doi-asserted-by":"crossref","unstructured":"R. Boppana, M. Sipser, The complexity of finite functions, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, MIT Press\/Elsevier, 1990, pp. 757\u2013804.","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"10.1016\/S0304-3975(99)00142-5_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02023010","article-title":"A lower bound for the complexity of Craig's interpolants in sentential logic","volume":"23","author":"Mundici","year":"1983","journal-title":"Archiv f\u201dur Math. Logik"},{"key":"10.1016\/S0304-3975(99)00142-5_BIB7","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","article-title":"Lower bounds for resolution and cutting planes proofs and monotone computations","volume":"62","author":"Pudl\u00e1k","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(99)00142-5_BIB8","doi-asserted-by":"crossref","unstructured":"P. Pudl\u00e1k, J. Sgall, Algebraic models of computation and interpolation for algebraic proof systems, in: P. Beame, S. Buss (Ed.), Proof Complexity and Feasible Arithmetics, American Mathematical Society, 1998, pp. 279\u2013296.","DOI":"10.1090\/dimacs\/039\/15"},{"key":"10.1016\/S0304-3975(99)00142-5_BIB9","first-page":"798","article-title":"Lower bounds on the monotone complexity of some Boolean functions","volume":"281","author":"Razborov","year":"1985","journal-title":"Dokl. Akad. Nauk. SSSR"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001425?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:09:08Z","timestamp":1580857748000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397599001425"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00142-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}