English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Evaluating Branching Heuristics in Interval Constraint Propagation for Satisfiability

MPS-Authors
/persons/resource/persons215575

Zufferey,  Damien
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Huang, C., Kong, S., Gao, S., & Zufferey, D. (2019). Evaluating Branching Heuristics in Interval Constraint Propagation for Satisfiability. In M. Zamani, & D. Zufferey (Eds.), Numerical Software Verification (pp. 85-100). Berlin: Springer. doi:10.1007/978-3-030-28423-7_6.


Cite as: https://hdl.handle.net/21.11116/0000-0005-E42D-8
Abstract
There is no abstract available