"The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when ..."

Nikolai K. Kossovsky, A. B. Prokhoroff (1992)

> Home

Details and statistics

DOI: 10.1007/BFB0023878

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lfcs/KossovskyP92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lfcs/KossovskyP92
Nikolai K. Kossovsky, A. B. Prokhoroff:
The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited. LFCS 1992: 241-245

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.