Skip to main content
Article thumbnail
Location of Repository

CS266: Parameterized Algorithms and Complexity

By 

Abstract

In this lecture we will talk about three problems that we don’t think are FPT, and show faster than trivial algorithms for them. k-SUM • Input: a set of n integers A = {a1,..., an}

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.1155
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.stanford.edu/~rrwil... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.