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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 326; H. 1; S. 419 - 429
1. Verfasser:	Cheng, Qi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 20.10.2004 Elsevier
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!