Complexity of matching problems
Year: 1985
Type: conference-paper
Parent work: Rewriting Techniques and Applications
Authors: Dan Benanav, Deepak Kapur, Paliath Narendran
Institution: General Electric (United States)
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: NP-completeness, term matching
Open Access status: closed
OpenAlex ID: W2146163384
