HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Author:Bernardo Subercaseaux

Publications
Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition
Bernardo Subercaseaux
In:Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning
Toward Optimal Radio Colorings of Hypercubes via SAT-solving
Bernardo Subercaseaux and Marijn Heule
In:Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning

Keyphrases

Blocked-clause Addition, CNF formulas, hypercubes, NP-hardness, Preprocessing, radio colorings, SAT, SAT solving.

Copyright © 2012-2025 easychair.org. All rights reserved.