"Solving hard instances in QF-BV combining Boolean reasoning with computer ..."

Markus Wedler et al. (2009)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-23

- view
  - electronic edition @ dagstuhl.de (open access)
- export record
  dblp key:
  - conf/dagstuhl/WedlerPDSSGK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/WedlerPDSSGK09
Markus Wedler, Evgeny Pavlenko, Alexander Dreyer, Frank Seelisch, Dominik Stoffel, Gert-Martin Greuel, Wolfgang Kunz:
Solving hard instances in QF-BV combining Boolean reasoning with computer algebra. Algorithms and Applications for Next Generation SAT Solvers 2009

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.