Register Allocation After Classical SSA Elimination is NP-Complete.
Fernando Magno Quintão PereiraJens PalsbergPublished in: FoSSaCS (2006)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- constraint satisfaction problems
- computational complexity
- polynomially solvable
- pspace complete
- resource allocation
- phase transition
- conjunctive queries
- website
- resource allocation problems
- np complete problems
- polynomial time complexity
- database
- classical methods
- multi agent
- knowledge base