Exact exponential algorithms and parameterized complexity指数算法和参数复杂性(Introduction to Algorithms, 算法导论

Exact exponential algorithms and parameterized complexity

We usually want algorithms that:

  • in polynomial time;
  • for all instances;
  • find an exact solution;

We can settle for 2 out of 3:

  • relax 1: exponential algorithm
  • relax 2: parameterized
  • relax 3: approximate solutions

1. Exact exponential algorithms

  • the length of a certificate at most: ∣ y ∣ ≤ m ( x ) |y|\le m(x) ym(x); m ( x ) ∈ O ( p o l y ∣ x ∣ ) m(x)\in O(poly|x|) m(x)O(polyx)
  • every problem in NP has a simple brute-force algorithm:
    • Given a instance x x x, try all potential certificates y y y with ∣ y ∣ ≤ m ( x ) |y|\le m(x) ym(x) and check if R ( x , y ) = 1 R(x,y)=1 R(x,y)=1 for any of them.
    • since y ≤ m ( x ) y\le m(x) ym(x), there are at most O ( 2 m ( x ) ) O(2^{m(x)}) O(2m(x)) potential certificates, and it takes O ( p o l y ∣ x ∣ ) O(poly|x|) O(polyx) time to check each certificate, so the brute force algorithm for a NP problem can run in O ( 2 m ( x ) p o l y ∣ x ∣ ) O(2^{m(x)}poly|x|) O(2m(x)polyx).

2. Notation: O ∗ ( ⋅ ) O^*(·) O():

For any a > 1 a>1 a>1, ε > 0 \varepsilon>0 ε>0, and any c ∈ R c\in R cR , we have the running time for the simple brute-force algorithm O ∗ ( 2 m ( x ) ) O^*(2^{m(x)}) O(2m(x)).

Since: O ( n c ⋅ a n ) ⊂ O ( ( a + ε ) n

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值