𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables

✍ Scribed by Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh…

Book ID
120910024
Publisher
Springer
Year
2012
Tongue
English
Weight
665 KB
Volume
68
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Fixed Parameter Tractable Algor
A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees
✍ Piovesan, Teresa; Kelk, Steven M. 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 243 KB

Here, we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time ð6 r r!Þ Á polyðnÞ, where n ¼ jXj. The novelty of this approach is its use of terminals, which are maximal elements of a na

[Lecture Notes in Computer Science] Theo
[Lecture Notes in Computer Science] Theory and Applications of Satisfiability Testing – SAT 2014 Volume 8561 || Fixed-Parameter Tractable Reductions to SAT
✍ Sinz, Carsten; Egly, Uwe 📂 Article 📅 2014 🏛 Springer International Publishing 🌐 English ⚖ 311 KB

This book constitutes the refereed proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 21 regular papers, 7 short papers and 4 tool papers presente