Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable. Makarychev, K.; Makarychev, Y.; and Zhou, Y. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 975–993, 2015.
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/focs/MakarychevMZ15,
  author    = {Konstantin Makarychev and
               Yury Makarychev and
               Yuan Zhou},
  title     = {Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable},
  booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages     = {975--993},
  year      = {2015},
  crossref  = {DBLP:conf/focs/2015},
  url       = {https://doi.org/10.1109/FOCS.2015.64},
  doi       = {10.1109/FOCS.2015.64},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/MakarychevMZ15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0