## Minimum Propositional Proof Length is NP-Hard to Linearly Approximate (Extended Abstract) (1998)

### Cached

### Download Links

- [math.ucsd.edu]
- [euclid.ucsd.edu]
- [euclid.ucsd.edu]
- [euclid.ucsd.edu]
- [euclid.ucsd.edu]
- DBLP

### Other Repositories/Bibliography

by
Michael Alekhnovich
,
Sam Buss Shlomo Moran
,
Sam Buss
,
Shlomo Moran
,
Toniann Pitassi

Venue: | Journal of Symbolic Logic |

Citations: | 37 - 7 self |