{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:54:41Z","timestamp":1648961681524},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0166-218x(91)90074-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"3-16","source":"Crossref","is-referenced-by-count":1,"title":["Constructive complexity"],"prefix":"10.1016","volume":"34","author":[{"given":"Karl","family":"Abrahamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard M.E.","family":"Moret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90074-7_BIB1","first-page":"136","article-title":"Self-reducibility","author":"Balcazar","year":"1987","journal-title":"Proceedings Symposium on Theoretical Aspects of Computer Science STACS-87"},{"key":"10.1016\/0166-218X(91)90074-7_BIB2","series-title":"Foundations of Constructive Mathematics","author":"Beeson","year":"1980"},{"key":"10.1016\/0166-218X(91)90074-7_BIB3","first-page":"188","article-title":"Nontransitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond","author":"Brassard","year":"1986","journal-title":"Proceedings 27th Symposium on Foundations of Computer Science FOCS-86"},{"key":"10.1016\/0166-218X(91)90074-7_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(87)90054-8","article-title":"Nonconstructive advances in polynomial-time complexity","volume":"26","author":"Fellows","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(91)90074-7_BIB5","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","article-title":"Nonconstructive tools for proving polynomial-time decidability","volume":"35","author":"Fellows","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(91)90074-7_BIB6","first-page":"278","article-title":"Fast self-reduction algorithms for combinatorial problems of VLSI design","author":"Fellows","year":"1988","journal-title":"Proceedings 3rd Aegean Workshop on Computing"},{"key":"10.1016\/0166-218X(91)90074-7_BIB7","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/73007.73055","article-title":"On search, decision, and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989","journal-title":"Proceedings 21st Annual ACM Symposium on Theory of Computing STOC-89"},{"key":"10.1016\/0166-218X(91)90074-7_BIB8","doi-asserted-by":"crossref","unstructured":"H. Friedman, N. Robertson and P.D. Seymour, The metamathematics of the graph minor theorem, in: Applications of Logic to Combinatorics (Amer. Math. Soc., Providence, RI, to appear).","DOI":"10.1090\/conm\/065\/891251"},{"key":"10.1016\/0166-218X(91)90074-7_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(91)90074-7_BIB10","first-page":"174","article-title":"Proofs that yield nothing but their validity and a methodology of cryptographic protocol design","author":"Goldreich","year":"1986","journal-title":"Proceedings 27th Symposium on Foundations of Computer Science FOCS-86"},{"key":"10.1016\/0166-218X(91)90074-7_BIB11","unstructured":"R. Impagliazzo and E. Tardos, Private communication reported by E. Allender."},{"key":"10.1016\/0166-218X(91)90074-7_BIB12","first-page":"285","article-title":"The many faces of polynomial time","volume":"8","author":"Johnson","year":"1987","journal-title":"The NP-Completeness Column: An Ongoing Guide"},{"key":"10.1016\/0166-218X(91)90074-7_BIB13","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1145\/22145.22197","article-title":"Are search and decision problems computationally equivalent","author":"Karp","year":"1985","journal-title":"Proceedings 17th ACM Symposium on Theory of Computing STOC-85"},{"key":"10.1016\/0166-218X(91)90074-7_BIB14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(87)90078-8","article-title":"On helping by robust oracle machines","volume":"52","author":"Ko","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(91)90074-7_BIB15","series-title":"Ph.D. Dissertation","article-title":"The complexity of optimization problems","author":"Krentel","year":"1987"},{"key":"10.1016\/0166-218X(91)90074-7_BIB16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log-space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0166-218X(91)90074-7_BIB17","first-page":"115","article-title":"Universal sequential search problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0166-218X(91)90074-7_BIB18","unstructured":"E.M. Luks, Private communication."},{"key":"10.1016\/0166-218X(91)90074-7_BIB19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/800133.804331","article-title":"On the nlog n isomorphism technique","author":"Miller","year":"1978","journal-title":"Proceedings 10th ACM Symposium on Theory of Computing STOC-78"},{"key":"10.1016\/0166-218X(91)90074-7_BIB20","first-page":"281","article-title":"Well quasi orderings, long games and a combinatorial study of undecidability","volume":"65","author":"Nesetril","year":"1987"},{"key":"10.1016\/0166-218X(91)90074-7_BIB21","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0019-9958(86)80024-9","article-title":"The density and complexity of polynomial cores for intractable sets","volume":"70","author":"Orponen","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(91)90074-7_BIB22","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic algorithms for testing primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"key":"10.1016\/0166-218X(91)90074-7_BIB23","series-title":"Eurocrypt 85","first-page":"31","article-title":"Efficient factoring based on partial information","volume":"219","author":"Rivest","year":"1985"},{"key":"10.1016\/0166-218X(91)90074-7_BIB24","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0606030","article-title":"Disjoint paths\u2014a survey","volume":"6","author":"Robertson","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(91)90074-7_BIB25","series-title":"Surveys in Combinatorics","first-page":"153","article-title":"Graph minors\u2014a survey","author":"Robertson","year":"1985"},{"key":"10.1016\/0166-218X(91)90074-7_BIB26","first-page":"21","article-title":"Nondeterministic log n space","author":"Savitch","year":"1974","journal-title":"Proceedings 8th Annual Princeton Conference on Information Sciences and Systems"},{"key":"10.1016\/0166-218X(91)90074-7_BIB27","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BFb0120931","article-title":"On self-transformable combinatorial problems","volume":"14","author":"Schnorr","year":"1981","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(91)90074-7_BIB28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(85)90158-6","article-title":"Robust algorithms: A different approach to oracles","volume":"40","author":"Sch\u00f6ning","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(91)90074-7_BIB29","series-title":"Relative complexity of checking and evaluating","author":"Valiant","year":"1974"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91900747?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91900747?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:16Z","timestamp":1555136536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X91900747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0166218X91900747"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90074-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}