An enumeration algorithm is, in computer science, an algorithm that enumerates the answers to a computational problem. Instead of returning a single result, it must produce the complete list of all solutions to the problem for a given input, and it must not repeat a solution. Because the number of answers can be very large, enumeration algorithms are judged by more than total running time. The lead of the source describes measuring the total time needed to generate all solutions, the maximum delay between consecutive outputs, and the preprocessing time before the first solution appears. This makes the delay between answers a central design concern for the family.
Facts
Classification
Design Technique Connections
In Field
Source Enumeration algorithm (Wikipedia)
Uses Design Technique
Sources
1. Enumeration algorithm (Wikipedia)
Lead section
In computer science, an enumeration algorithm is an algorithm that enumerates the answers to a computational problem.
- In Field: Algorithms and Complexity Theory, Lead paragraph
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.