Abstract: E-graphs have attracted growing interest in many fields, particularly in logic synthesis and formal verification. E-graph extraction is a challenging NP-hard combinatorial optimization ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results