Back to Results
First PageMeta Content



Universit´e Henri Poincar´e – LORIA (INRIA) Unbounded Proof-Length Speed-up in Deduction Modulo 16th EACSL Annual Conference on Computer Science and Logic
Add to Reading List

Document Date: 2015-01-06 05:28:56


Open Document

File Size: 514,15 KB

Share Result on Facebook