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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 326; no. 1; pp. 419 - 429
Main Author:	Cheng, Qi
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 20.10.2004 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!