A syntactic characterization of NP-completeness
Year: 2002
Type: conference-paper
Authors: J.A. Medina, N. Immerman
Institution: University of Massachusetts Amherst
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2152196641
