Hostname: page-component-cb9f654ff-5jtmz Total loading time: 0 Render date: 2025-08-28T19:32:36.555Z Has data issue: false hasContentIssue false
  • English
  • Français

Michael Alekhnovich, Sam Buss, Shlomo Moran, and Toniann Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. The journal of symbolic logic, vol. 66 (2001), pp. 171–191.

Review products

Michael Alekhnovich, Sam Buss, Shlomo Moran, and Toniann Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. The journal of symbolic logic, vol. 66 (2001), pp. 171–191.

Published online by Cambridge University Press:  15 January 2014

Alexander Razborov
Alexander Razborov*
Affiliation:
Steklov Mathematical Institute, str. Gubkina 8, 117966 Moscow GSP-1, Russia. razborov@genesis.mi.ras.ru.
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 8 , Issue 2 , June 2002 , pp. 301 - 302
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable