Back to UK deals/Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure : Proof Engines for the Analysis of Hybrid Discrete-Continuous Systems

Springer Nature

Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure : Proof Engines for the Analysis of Hybrid Discrete-Continuous Systems

Name: Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure : Proof Engines for the Analysis of Hybrid Discrete-Continuous Systems
Brand: Springer Nature