"Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying ..."

Takayuki Sato et al. (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-69733-6_20

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/SatoATM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/SatoATM08
Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka:
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. COCOON 2008: 191-203

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.