A universal scaling theory for complexity of analog computation

Yaniv S. Avizrats, Shmuel Fishman, Joshua Feinberg

Research output: Contribution to journalArticlepeer-review

Abstract

We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability ensembles of linear programming problems. For each one of these we obtain numerically the probability distribution functions of certain quantities which measure the complexity. Remarkably, in the asymptotic limit of very large problems, each of these probability distribution functions reduces to a universal scaling function, depending on a single scaling variable and independent of the details of its parent probability ensemble. These functions are reminiscent of the scaling functions familiar in the theory of phase transitions. The results reported here extend analytical and numerical results obtained recently for the Gaussian ensemble.

Original languageEnglish
Pages (from-to)271-274
Number of pages4
JournalPhysics Letters, Section A: General, Atomic and Solid State Physics
Volume371
Issue number4
DOIs
StatePublished - 19 Nov 2007

Bibliographical note

Funding Information:
It is a pleasure to thank our colleagues Asa Ben-Hur and Hava Siegelmann for advice and discussions. This research was supported in part by the Shlomo Kaplansky Academic Chair, by the Technion-Haifa University Collaboration Fund, by the US–Israel Binational Science Foundation (BSF), by the Israeli Science Foundation, and by the Minerva Center of Nonlinear Physics of Complex Systems.

ASJC Scopus subject areas

  • Physics and Astronomy (all)

Fingerprint

Dive into the research topics of 'A universal scaling theory for complexity of analog computation'. Together they form a unique fingerprint.

Cite this