"Max Sat and Min Set Cover Approximation Algorithms are P-Complete."

Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino (1995)

> Home

Details and statistics

DOI: 10.1142/S0129626495000278

access: closed

type: Journal Article

metadata version: 2023-02-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ppl/BongiovanniCA95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ppl/BongiovanniCA95
Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino:
Max Sat and Min Set Cover Approximation Algorithms are P-Complete. Parallel Process. Lett. 5: 293-298 (1995)

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.