z-logo
open-access-imgOpen Access
Study of the NP-completeness of the compact table problem
Author(s) -
JeanChristophe Dubacq,
Jean-Yves Moyen
Publication year - 2008
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - completeness (order theory) , np complete , table (database) , computer science , word (group theory) , mathematics , computational complexity theory , discrete mathematics , arithmetic , theoretical computer science , algorithm , data mining , mathematical analysis , geometry

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