The complexity of facets resolved
type: Item
instance of: scholarly article
title: The complexity of facets resolved
zbMATH Open document ID: 0655.68041
DOI: 10.1016/0022-0000(88)90042-6
author: Christos Papadimitriou
author: David Wolfe
published in: Journal of Computer and System Sciences
publication date: 1988-01-01T00:00:00Z
full work available at URL: https://hdl.handle.net/1813/6542
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 4070307
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: facets
zbMATH Keywords: traveling salesman problem polytope
zbMATH Keywords: D p-complete
MaRDI profile type: Publication
OpenAlex ID: W2158505527
Wikidata QID: Q59795818
cites work: On the unique satisfiability problem
cites work: On certain polytopes associated with graphs
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Q4198056
cites work: On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets
cites work: Q4739657
cites work: The complexity of facets (and some facets of complexity)
cites work: NP is as easy as detecting unique solutions
DBLP publication ID: journals/jcss/PapadimitriouW88
description: scientific article; zbMATH DE number 4070307