{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T23:08:52Z","timestamp":1776726532203,"version":"3.51.2"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0925-7721(95)00015-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"85-98","source":"Crossref","is-referenced-by-count":15,"title":["A computationally intractable problem on simplicial complexes"],"prefix":"10.1016","volume":"6","author":[{"given":"\u00d6mer","family":"E\u011fecio\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teofilo F.","family":"Gonzalez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00015-1_BIB1","series-title":"Proc. 31st Symposium on Foundations of Computer Science","article-title":"Proof verification and intractability of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/0925-7721(95)00015-1_BIB2","series-title":"Proc. 25th Annual Symposium on the Theory of Computing","first-page":"294","article-title":"Efficient probabilistically checkable proofs and applications to approximation","author":"Bellare","year":"1993"},{"key":"10.1016\/0925-7721(95)00015-1_BIB3","series-title":"Proc. 25th Annual Symposium on the Theory of Computing","first-page":"91","article-title":"Generalized FLP impossibility result for t-resilient asynchronous computations","author":"Borowsky","year":"1993"},{"key":"10.1016\/0925-7721(95)00015-1_BIB4","series-title":"Linear decision trees, subspace arrangements and M\u00f6bius functions","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/0925-7721(95)00015-1_BIB5","series-title":"Proc. 24th Annual Symposium on the Theory of Computing","first-page":"170","article-title":"Linear decision trees: volume estimates and topological bounds","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/0925-7721(95)00015-1_BIB6","series-title":"Proc. 3rd Annual Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0925-7721(95)00015-1_BIB7","article-title":"A computationally intractable problem on simplicial complexes","author":"E\u011fecio\u011flu","year":"1993","journal-title":"Tech. Rep. UCSB TRCS93-1"},{"key":"10.1016\/0925-7721(95)00015-1_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0925-7721(95)00015-1_BIB9","volume":"Vol. I","author":"Glaser","year":"1970"},{"key":"10.1016\/0925-7721(95)00015-1_BIB10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(95)00022-5","article-title":"LP-free approximation algorithm for the minimum weight vertex cover problem","volume":"54","author":"Gonzalez","year":"1995","journal-title":"Information Processing Letters"},{"key":"10.1016\/0925-7721(95)00015-1_BIB11","series-title":"Proc. 26th Annual Symposium on the Theory of Computing","first-page":"635","article-title":"Complexity lower bounds on testing membership to a polyhedron by algebraic decision trees","author":"Grigoriev","year":"1994"},{"key":"10.1016\/0925-7721(95)00015-1_BIB12","series-title":"Proc. 25th Annual Symposium on the Theory of Computing","first-page":"111","article-title":"The asynchronous computability theorem for t-resilient tasks","author":"Herlihy","year":"1993"},{"key":"10.1016\/0925-7721(95)00015-1_BIB13","series-title":"Topology","author":"Hocking","year":"1961"},{"key":"10.1016\/0925-7721(95)00015-1_BIB14","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0925-7721(95)00015-1_BIB15","series-title":"Introduction to Topology","author":"Lefschetz","year":"1949"},{"key":"10.1016\/0925-7721(95)00015-1_BIB16","series-title":"Proc. 25th Annual Symposium on the Theory of Computing","first-page":"286","article-title":"On the hardness of approximating minimization problems","author":"Lund","year":"1993"},{"key":"10.1016\/0925-7721(95)00015-1_BIB17","series-title":"Algebraic Topology: An Introduction","author":"Massey","year":"1967"},{"key":"10.1016\/0925-7721(95)00015-1_BIB18","series-title":"Elements of Algebraic Topology","author":"Munkres","year":"1984"},{"key":"10.1016\/0925-7721(95)00015-1_BIB19","series-title":"Proc. 25th Annual Symposium on the Theory of Computing","first-page":"101","article-title":"Wait-free k-set agreement is impossible: the topology of public knowledge","author":"Saks","year":"1993"},{"key":"10.1016\/0925-7721(95)00015-1_BIB20","series-title":"Proc. 33rd Symposium on Foundations of Computer Science","first-page":"268","article-title":"Algebraic decision trees and Euler characteristics","author":"Yao","year":"1992"},{"key":"10.1016\/0925-7721(95)00015-1_BIB21","series-title":"Proc. 26th Annual Symposium on the Theory of Computing","first-page":"615","article-title":"Decision tree complexity and Betti numbers","author":"Yao","year":"1994"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000151?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000151?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T01:55:18Z","timestamp":1556675718000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0925772195000151"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00015-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}