On the ultimate complexity of factorials

It has long been observed that certain factorization algorithms provide a way to write the product of many different integers succinctly. In this paper, we study the problem of representing the product of all integers from 1 to n (i.e. n ! ) by straight-line programs. Formally, we say that a sequenc...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 326; číslo 1; s. 419 - 429
Hlavní autor:	Cheng, Qi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 20.10.2004 Elsevier
Témata:	Algebra Algorithmics. Computability. Computer arithmetics Applied sciences Computational and structural complexity Computer science; control theory; systems Exact sciences and technology Mathematics Number theory Sciences and techniques of general use Theoretical computing Computational and structural complexity Integer Upper bound Computer theory Structural complexity Computational complexity Factorization Number theory
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!