Functions and Analysis

    

Finding the Maximum of a Polynomial Time Computable Bounded Smooth Function on an Interval is NP-Complete

Authors: Warren D. Smith

Ker-I Ko in his 1991 book "Complexity theory of real functions" (Birkhauser) defined the notions of polynomial-time computable (P.T.C.) real numbers and real functions. On p.106 he posed as an open question "whether differentiability helps in computing maximum values." We argue the answer is "no."

But in order to make this argument, Ko's theory needs to be extended to encompass notions of the codelength of a P.T.C. real number, and the code transformation time for various real arithmetic operations. The question in Ko's unextended theory remains unsolved.

Our result is: If F(x) is C and bounded and P.T.C. on [0,1], then the maximum M of F on [0,1] either

  1. is not P.T.C.,
  2. or if it is, then the code of M is not produceable by a polytime algorithm from the code for F, or
  3. P=NP.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2026-07-23 17:13:40

Unique-IP document downloads: 0 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus