Path: utzoo!utgpu!utcsri!arvind
From: arvind@utcsri.UUCP (Arvind Gupta)
Newsgroups: ut.theory
Subject: THEORY NET: Complexity of Optimal Addition Chains
Message-ID: <5764@utcsri.UUCP>
Date: 6 Jan 88 15:00:03 GMT
Article-I.D.: utcsri.5764
Posted: Wed Jan  6 10:00:03 1988
Distribution: ut
Organization: CSRI, University of Toronto
Lines: 8

*** REPLACE THIS LINE WITH YOUR MESSAGE ***
Date:         8 Dec 1987 15:18:48-EST (Tuesday)
From: "Victor S. Miller" <VICTOR@yktvmz.bitnet>
Subject:      Complexity of optimal addition chains

Given a positive integer n, written in unary, is it known if finding the
least cost addition chain for n is in P?