Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

JAC
2008

favoriteEmaildiscussreport

209views Artificial Intelligence» more JAC 2008»

Study of the NP-completeness of the compact table problem

13 years 6 months ago

Study of the NP-completeness of the compact table problem

Download www.lif.univ-mrs.fr

The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This problem is shown to be NP-complete in the general case, and some specific restrictions are studied.

Jean-Christophe Dubacq, Jean-Yves Moyen

Real-time Traffic

Artificial Intelligence | Compact Tables | General Case | JAC 2008 | Specific Restrictions |

claim paper

Related Content

» Table design in dynamic programming

» Compact Multicast Routing

» Querying Websites Using Compact Skeletons

» On Compact Routing for the Internet

» Gene Specific Coregulation Discovery An Improved Approach

» Compressing Bitmap Indices by Data Reorganization

» Drawing Borders Efficiently

» Object location using path separators

» QCTrees An Efficient Summary Structure for Semantic OLAP

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	JAC
Authors	Jean-Christophe Dubacq, Jean-Yves Moyen

Comments (0)