Ideas for optimization

Jump to bottom

Lars Friese edited this page Sep 23, 2025 · 1 revision

for complement law: determine biggest complement pairs to delete before anything else
use dag: "Directed Acyclic Graphs" to basically handle duplicate subtrees by using the same reference
detect repetitions in the main loops