Work

Complete problems for deterministic polynomial time

Year: 1974

Type: conference-paper

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/800119.803883

Authors: Neil D. Jones, William T. Laaser

Institution: University of Kansas

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: W2064577184

FWCI: 5.066

Cites: 8

Cited by: 43

Related to: 10