"Complexity of propositional proofs under a promise."

Nachum Dershowitz, Iddo Tzameret (2010)

> Home

Details and statistics

DOI: 10.1145/1740582.1740586

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/DershowitzT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/DershowitzT10
Nachum Dershowitz, Iddo Tzameret:
Complexity of propositional proofs under a promise. ACM Trans. Comput. Log. 11(3): 18:1-18:30 (2010)

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.