"On the Complexity and Inapproximability of Shortest Implicant Problems."

Christopher Umans (1999)

> Home

Details and statistics

DOI: 10.1007/3-540-48523-6_65

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/icalp/Umans99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Umans99
Christopher Umans:
On the Complexity and Inapproximability of Shortest Implicant Problems. ICALP 1999: 687-696

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.