Fusing Loopless Algorithms for Combinatorial Generation
Loopless algorithms are an interesting challenge in the field of combinatorial generation. These algorithms must generate each combinatorial object from its predecessor in no more than a constant number of instructions, thus achieving theoretically minimal time complexity. This constraint rules out...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Canterbury. Computer Science and Software Engineering
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10092/1075 |