Work

A comparison of polynomial time reducibilities

Year: 1975

Type: article

Source: Theoretical Computer Science

DOI: 10.1016/0304-3975(75)90016-x

Authors: R.E. Ladner, N.A. Lynch, A.L. Selman

Institutions: University of Washington, University of Southern California, Florida State University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W1986203294

FWCI: 5.373

Cites: 13

Cited by: 406

Related to: 9