On the Structure of Polynomial Time Reducibility
1975; Association for Computing Machinery; Volume: 22; Issue: 1 Linguagem: Inglês
10.1145/321864.321877
ISSN1557-735X
Autores Tópico(s)Constraint Satisfaction and Optimization
Resumoarticle Free AccessOn the Structure of Polynomial Time Reducibility Author: Richard E. Ladner Department of Computer Science, University of Washington, Seattle, WA Department of Computer Science, University of Washington, Seattle, WAView Profile Authors Info & Claims Journal of the ACMVolume 22Issue 1Jan. 1975 pp 155–171https://doi.org/10.1145/321864.321877Published:01 January 1975Publication History 499citation5,763DownloadsMetricsTotal Citations499Total Downloads5,763Last 12 Months470Last 6 weeks48 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Referência(s)