"Scalable formula decomposition for propositional satisfiability."

Anthony Monnet, Roger Villemaire (2010)

> Home

Details and statistics

DOI: 10.1145/1822327.1822333

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/c3s2e/MonnetV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/c3s2e/MonnetV10
Anthony Monnet, Roger Villemaire:
Scalable formula decomposition for propositional satisfiability. C3S2E 2010: 43-52

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.