A simple NP-hard problem

R. Demontis · ACM SIGACT News · 2009

technical-note Share on A simple NP-hard problem Author: R. Demontis University of Torino University of TorinoView Profile Authors Info & Claims ACM SIGACT NewsVolume 40Issue 2June 2009 pp 45–48https://doi.org/10.1145/1556154.1556167Online:20 June 2009Publication History 1citation392DownloadsMetricsTotal Citations1Total Downloads392Last 12 Months7Last 6 weeks2 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 SiteGet Access

Read the paper · More papers on PaperTik