"Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate."

Michael Alekhnovich et al. (2001)

> Home

Details and statistics

DOI: 10.2307/2694916

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/AlekhnovichBMP01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/AlekhnovichBMP01
Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi:
Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. J. Symb. Log. 66(1): 171-191 (2001)

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.