Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
nicg [2011/12/09 12:46] slobodan.mitrovic |
nicg [2011/12/14 14:42] vkuncak |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Non-Redundant Integer Cones - Resources ====== | ====== Non-Redundant Integer Cones - Resources ====== | ||
| - | The following are the non-redundant integer cones modulo row and column permutations: | + | This page describes our work on computing maximal non-redundant integer cone generators. The algorithms, implementations, and results are described in the following technical report: |
| + | |||
| + | {{projects:nicg.pdf|Identifying Maximal Non-Redundant Integer Cone Generators}} | ||
| + | |||
| + | As part of this search we have also explicitly computed all non-redundant integer cones modulo row and column permutations: | ||
| * [[bapa:NICG-Four|dimension 4]] | * [[bapa:NICG-Four|dimension 4]] | ||
| * [[bapa:NICG-Five|dimension 5]] | * [[bapa:NICG-Five|dimension 5]] | ||
| * [[bapa:NICG-Six|dimension 6]] | * [[bapa:NICG-Six|dimension 6]] | ||
| + | For more background on this work, please consult the technical report as well as the following paper from CADE 2007: | ||
| + | *[[http://lara.epfl.ch/~kuncak/papers/KuncakRinard07TowardsEfficientSatisfiabilityCheckingBoolean.html|Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic]] | ||