The complexity of facets resolved

Papadimitriou, CH; Wolfe, D

dc.contributor.author	Papadimitriou, CH	en
dc.contributor.author	Wolfe, D	en
dc.date.accessioned	2014-03-01T01:07:17Z
dc.date.available	2014-03-01T01:07:17Z
dc.date.issued	1988	en
dc.identifier.issn	0022-0000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9904
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-38249026994&partnerID=40&md5=1c8713cb44f552f85950871d4c646c96	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	The complexity of facets resolved	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1988	en
heal.abstract	We show that recognizing the facets of the traveling salesman problem polytope is Dp-complete. © 1988.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Journal of Computer and System Sciences	en
dc.identifier.isi	ISI:A1988Q490700002	en
dc.identifier.volume	37	en
dc.identifier.issue	1	en
dc.identifier.spage	2	en
dc.identifier.epage	13	en