3 ms·
Why would using registers make it NP complete? If there are no registers to allocate, then there is no Core Register Allocation (NP complete) problem. Is there
by downvotetruth 4y ago
Why would using registers make it NP complete? If there are no registers to allocate, then there is no Core Register Allocation (NP complete) problem.
Is there a reason concatenative languages aren't (naturally) primal chordal graphs? "Naturally" is not distinctive, but concatenative languages can be compiled to registers & induce the Core Register Allocation problem that was proven NP complete by use of primal chordal graphs.