Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Apratim Choudhury
Tidjani Négadi
Daniel P. Kennedy
Barbara Aquilani
Jing Li
Ben Robins
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Home
/
Paper
/
Hardness of Approximating Sigma2p Minimization Problems
Paper Info
Open Visualization
Title
Hardness of Approximating Sigma2p Minimization Problems
Year
Venue
Keywords
1999
FOCS
hardness of approximation,optimization problem,set cover,satisfiability
DocType
Citations
PageRank
Conference
16
1.14
References
Authors
16
1
Authors (1 rows)
Cited by (16 rows)
References (16 rows)
Name
Order
Citations
PageRank
Christopher Umans
1
879
55.36
1