"Optimal length tree-like resolution refutations for 2SAT formulas."

K. Subramani (2004)

> Home

Details and statistics

DOI: 10.1145/976706.976711

access: closed

type: Journal Article

metadata version: 2024-02-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/Subramani04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/Subramani04
K. Subramani:
Optimal length tree-like resolution refutations for 2SAT formulas. ACM Trans. Comput. Log. 5(2): 316-320 (2004)

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.