Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

"Minimal" programs #9

Open
ilya-klyuchnikov opened this issue Aug 25, 2011 · 0 comments
Open

"Minimal" programs #9

ilya-klyuchnikov opened this issue Aug 25, 2011 · 0 comments
Labels
improvement

Comments

@ilya-klyuchnikov
Copy link
Owner

Search the most descriptive and concise variant of the given program. The idea: we can compare active graph with a current minimal graph and discard active graph if it is evidently will be bigger than current minimal graph. This should reduce a number of intermediate graphs.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
improvement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ilya-klyuchnikov