← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.757Z

reating keys for the RSA cryptosystem. Size of inputs and cost of arithmetic computations

Because we’ll be working with large integers, we need to adjust how to think about the size of an input and about the cost of elementary arithmetic operations. In this chapter, a “large input” typically means an input containing “large integers” rather than an input containing “many integers” (as for sorting). Thus, the size of an input depends on the number of bits required to represent that input, not just the number of integers in the input. An algorithm with

integer inputs a1, a2, …, ak is a polynomial-time algorithm if it runs in time polynomial

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea