Aliased register allocation for straight-line programs is NP-complete.
Jonathan K. LeeJens PalsbergFernando Magno Quintão PereiraPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- straight line
- np complete
- hough transform
- conp complete
- randomly generated
- np hard
- curvature estimation
- super resolution
- feature points
- vanishing points
- line detection
- conjunctive queries
- computational complexity
- resource allocation
- polynomial time complexity
- satisfiability problem
- line segments
- intersection points
- three dimensional
- phase transition
- low resolution
- radon transform
- bounded treewidth
- lower bound
- data sets
- digital straight line