z-logo
open-access-imgOpen Access
An Alternative proof of SAT NP-Completeness
Author(s) -
Bruno Escoffier,
Vangélis Th. Paschos
Publication year - 2004
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Book series
Subject(s) - completeness (order theory) , mathematics , computer science , calculus (dental) , programming language , discrete mathematics , medicine , mathematical analysis , dentistry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom