<table border="1" cellspacing="0" cellpadding="8">
    <tr>
        <th>Issue</th>
        <td>
            <a href=https://github.com/llvm/llvm-project/issues/55518>55518</a>
        </td>
    </tr>

    <tr>
        <th>Summary</th>
        <td>
            Implement output size reduction heuristics 
        </td>
    </tr>

    <tr>
      <th>Labels</th>
      <td>
            mlir:presburger
      </td>
    </tr>

    <tr>
      <th>Assignees</th>
      <td>
      </td>
    </tr>

    <tr>
      <th>Reporter</th>
      <td>
          Groverkss
      </td>
    </tr>
</table>

<pre>
    The output size representation of sets needs to be small to prevent a combinatorial explosion of constraints. For these heuristics, inspiration can be taken from ISL's simplification heuristics [1] and FPL prototype [1] (Not tested thoroughly). 

[1]: https://github.com/Groverkss/isl/blob/8847591c03fcb7df8734da0159ca5d654bbf5573/isl_map_simplify.c#L1516
[2] : https://github.com/Superty/llvm-project/blob/bf174deaabfcc00a83c8fd2d28575f0b269763a6/mlir/lib/Analysis/Presburger/PresburgerBasicSet.cpp#L569
</pre>
<img width="1px" height="1px" alt="" src="http://email.email.llvm.org/o/eJx9k9tq3DAQhp9GvhE1smT5cOGLTcOWQCiB9D7oMF6rkS2jkUO3T195NyRNCwEjS8zp_0YjHex5-DEBDVtat0TR_QYaYY2AsCSVXFhoGClCQroAWKQpUA0UZ-X9vs-eL9mTKmrCrN2iUohOeQq_Vh_wNdyEBVNUbklY0mOINE05P51giw6TM0j4V-oWXF28ljRq2ask9QwLHWOY6d3jPeEtZoHz6t3ozNXxPQUl8qYi8paqxdLjw31WFlJI5xXeLIR330OiCTCBzRpCDNtp8mfC-5ISdkvY4XW9BhBxoFNKK-YN4cf8nVyaNl1m1Hz4FsMLxGfM6o8OfV61Dzr_uq5uZV8ZJkajWzt2raitYpXsjZK2kbXWo5StuMY9zWp9esU6l4ZwcV_JqnlTwi_SP5fyuK0QUwY5ev8yf8noP8Gkd0V6rNraglJ6NIYx1QnTjZZb3slWjkzzpm8boZrsOnsX9zxujzssyp_R7YQPeST0Fk8QPxxuFDrzCKk067pLl01f2EHYXvSqSC55GO4yGsz7kHwcMruZf--w2KIfPuHc6f6HdIgb7BqllFVXTIPKTWajZEwbmTvNVF3XvKpl1-ped7YpvNLgccjdJZxfiMVh_Qtw73nhBs44Z7JqmZC97EvLpK17gLpRoq8rQWoGs3K-3PWUIZ6KOFyk6e2E2egzFb4bFaI75Ud0KZvzq20fweFtjIoLx3CB-AMchS0w">