"Lower bounds on the complexity of recognizing SAT by Turing machines."

Rahul Santhanam (2001)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(00)00227-1

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Santhanam01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Santhanam01
Rahul Santhanam:
Lower bounds on the complexity of recognizing SAT by Turing machines. Inf. Process. Lett. 79(5): 243-247 (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.