Work

Some NP-complete geometric problems

Year: 1976

Type: conference-paper

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/800113.803626

Authors: M. R. Garey, R. L. Graham, D. S. Johnson

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2066194644

FWCI: 6.21

Cites: 15

Cited by: 419

Related to: 10