Exponential-time Algorithm

本文介绍了指数时间算法的概念及其复杂度特点。指数时间算法是指在最坏情况下,算法运行时间随着问题规模呈指数增长的算法。这类算法对于小规模问题可能是可行的,但对于大规模问题则可能变得不切实际。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Exponential-time Algorithm in Technology

complexity

An algorithm (or Turing Machine) that is guaranteed to terminate within a number of steps which is a exponential function of the size of the problem. For example, if you have to check every number of n digits to find a solution, the complexity is O(10^n), and if you add an extra digit, you must check ten times as many as numbers.

Even if such an algorithm is practical for some given value of n, it is likely to become impractical for larger values. This is in contrast to a polynomial-time algorithm which grows more slowly.

See also computational complexity, polynomial-time, NP-complete.(1995-04-27)

---- from www.dictionary.com

The concept was found in ZOJ problem 1037.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值