default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"CNF Satisfiability Test by Counting and Polynomial Average Time."

Kazuo Iwama (1989)

> Home

Details and statistics

DOI: 10.1137/0218026

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Iwama89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Iwama89
Kazuo Iwama:
CNF Satisfiability Test by Counting and Polynomial Average Time. SIAM J. Comput. 18(2): 385-391 (1989)

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.