Satisfiability Checking - Fourier–Motzkin Variable Elimination
Satisfiability Checking - Fourier–Motzkin Variable Elimination
Satisfiability Checking - Fourier–Motzkin Variable Elimination
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Complexity<br />
Worst-case complexity:<br />
Heavy!<br />
The bottleneck: case-splitting<br />
m → m 2 → (m 2 ) 2 → . . . → m 2n<br />
Prof. Dr. Erika Ábrahám - <strong>Satisfiability</strong> <strong>Checking</strong> 10 / 10
Change language