Sciweavers

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

9

DAM
2011

favoriteEmaildiscussreport

203views Theoretical Computer Science» more DAM 2011»

On the expressive power of CNF formulas of bounded tree- and clique-width

12 years 11 months ago

On the expressive power of CNF formulas of bounded tree- and clique-width

Download perso.ens-lyon.fr

Irénée Briquel, Pascal Koiran, Klaus

Real-time Traffic

DAM 2011 | Theoretical Computer Science |

claim paper

Related Content

» Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

» Query Evaluation via TreeDecompositions

» Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees

» On the Power of TreeWalking Automata

» Tree Extension Algebras Logics Automata and Query Languages

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	DAM
Authors	Irénée Briquel, Pascal Koiran, Klaus Meer

Comments (0)