Nondeterministic Algorithms

  title={Nondeterministic Algorithms},
  author={R. Floyd},
  journal={J. ACM},
  • R. Floyd
  • Published 1967
  • Computer Science
  • J. ACM
  • Programs to solve combinatorial search problems may often be simply written by using multiple-valued functions. Such programs, although impossible to execute directly on conventional computers, may be converted in a mechanical way into conventional backtracking programs. The process is illustrated with algorithms to find all solutions to the eight queens problem on the chessboard, and to find all simple cycles in a network. 
    311 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    A procedure mechanism for backtrack programming
    • 18
    • PDF
    The Correctness of Nondeterministic Programs
    • Z. Manna
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1970
    • 49
    Different perspectives of the N-Queens problem
    • 48
    Non-deterministic programming
    • 7
    POPS: An Application of Heuristic Search Methods to the Processing of a Nondeterministic Programming Language
    • 2
    • PDF
    Control Structure Abstractions of the Backtracking Programming Technique
    • 30
    • PDF
    An interpreter for a nondeterministic language
    • J. Cohen, R. Stachel
    • Computer Science
    • International Journal of Computer & Information Sciences
    • 2004
    Linear Time Simulation of Invertible Non-Deterministic Stack Algorithms
    • N. Andersen
    • Computer Science
    • J. Univers. Comput. Sci.
    • 1997
    • PDF