https://cs.nyu.edu/~shw8119/
We prove that this algorithm only calls the oracle productively: the number of additional calls to the oracle (due to melding, etc) is bounded by the number of optimizations found.
We prove that this algorithm only calls the oracle productively: the number of additional calls to the oracle (due to melding, etc) is bounded by the number of optimizations found.
(As you might expect, the answer is yes.)
(As you might expect, the answer is yes.)
many existing tools are essentially superoptimizers, with exponential search spaces, and therefore can only handle "small" circuits in a reasonable amount of time/space
many existing tools are essentially superoptimizers, with exponential search spaces, and therefore can only handle "small" circuits in a reasonable amount of time/space
(“Medium scale” meaning large-ish single-node.)
(“Medium scale” meaning large-ish single-node.)
Yong Kiam’s talk was excellent! 👏
I am endlessly impressed with CakeML — such an exciting project
Yong Kiam’s talk was excellent! 👏
I am endlessly impressed with CakeML — such an exciting project