Advertisement

Pythia and Tyche: An Eternal Golden Braid

  • Lefteris M. Kirousis
  • Paul Spirakis
Conference paper
Part of the Fundamental Theories of Physics book series (FTPH, volume 24)

Abstract

There are two fundamental ways to introduce non-determinism in an algorithm. One is to provide an “oracle” that the algorithm can consult at certain stages of its execution in order to get answers for questions of a prespecified type. The second is to introduce randomness, i.e., to allow certain steps of the algorithm depend on the outcome of a random experiment. Both methods are essential in developing a theory of complexity for algorithms. In other words, both methods help in understanding the inherent difficulties associated with various types of problems and consequently, sometimes, they provide the insight necessary to obtain better deterministic algorithms (as we shall explain, random algorithms — as opposed to oracle computations - are on their own important in practice). In this paper, we explain the impact of these two forms of non-determinism on Complexity theory and we attempt to highlight the intriguing relation between them.

Keywords

Decision Procedure Travelling Salesman Problem Propositional Calculus Random Algorithm Satisfiability Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Free- man, San Francisco, 1979).zbMATHGoogle Scholar
  2. [2]
    K. Godel: ’Uber formal unentscheidbare Satze der Principia Mathematica und verwandter Systeme I’, Monatshefte fur Mathematic und Physik, 38, (1931) 173-198.CrossRefMathSciNetGoogle Scholar
  3. [2.A]
    English translation in: J. van Heijenoort: From Frege to GÖdel - a Sourcebook in Mathematical Logic 1879-1931 (Cambridge, Mass., 1967).Google Scholar
  4. 3.
    O. Goldreich, S. Micali and A. Wigderson: ″Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract)″, Proc. 27th IEEE Symp. on Foundations of Computer Science (1986) 174-187.Google Scholar
  5. [4]
    R. M. Karp: ″Combinatorics, complexity and randomness″, Turing Award Lecture, Communications of the Association for Computing Machinery 29 (1986) 98-111.CrossRefzbMATHMathSciNetGoogle Scholar
  6. [5]
    L. M. Kirousis and P. Spirakis: ″Probabilistic log-space reductions and problems probabilistically hard for P″, Technical Report, Computer Technology Institute (1987, Patras).Google Scholar
  7. [6]
    R. Solovay and V. Strassen: ″A fast Monte Carlo test for primality″, SIAM J. Comp. 6 (1977), 84-85.CrossRefzbMATHMathSciNetGoogle Scholar
  8. [7]
    R. Rivest, A. Shamir and L. Adleman: ″A method for obtaining digital signatures and public key cryptosystems″, Communications of the Association for Computing Machinery 21 (1978), 120-126.CrossRefzbMATHMathSciNetGoogle Scholar
  9. [8]
    A. M. Turing: ″On computable numbers, with an application to the Entscheidurigsoroblem″, Proc. London Math. Soc. ser. 2, vol. 42, (1936), 230-265.Google Scholar
  10. [9]
    U. V. Vazirani and V. V. Vazirani: ″A natural encoding scheme proved probabilistic polynomial complete″, Proc. 23rd IEEE Symp. on Foundations of Computer Science (1982) 40-44.Google Scholar

Copyright information

© Kluwer Academic Publishers 1989

Authors and Affiliations

  • Lefteris M. Kirousis
    • 1
  • Paul Spirakis
    • 2
    • 3
  1. 1.Department of MathematicsUniversity of PatrasGreece
  2. 2.Computer Technology InstituteGreece
  3. 3.Courant Inst. of Mathematical SciencesUSA

Personalised recommendations