Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications

Kanj, Iyad A.; Szeider, Stefan

doi:10.1007/978-3-319-12691-3_48

by Iyad A. Kanj, Stefan Szeider

Reference:

Parameterized and Subexponential-Time Complexity of Satisfiability Problems and ApplicationsIyad A. Kanj, Stefan SzeiderCombinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{KanjSzeider14,
  author    = {Iyad A. Kanj and Stefan Szeider},
  title     = {Parameterized and Subexponential-Time Complexity of Satisfiability
               Problems and Applications},
  booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
               {COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings},
  pages     = {637--651},
  year      = {2014},
  url       = {10.1007/978-3-319-12691-3_48">https://doi.org/10.1007/978-3-319-12691-3_48},
  doi       = {10.1007/978-3-319-12691-3_48},
  editor    = {Zhao Zhang and
               Lidong Wu and
               Wen Xu and
               Ding{-}Zhu Du},
  series    = LNCS,
  volume    = {8881},
  publisher = Springer,
}