Nondeterministic Algorithms
@article{Floyd1967NondeterministicA, title={Nondeterministic Algorithms}, author={R. Floyd}, journal={J. ACM}, year={1967}, volume={14}, pages={636-644} }
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
An Execution Mechanism for Nondeterministic, State-Oriented Programs Based on a Chart Parser
- Computer Science
- Inf. Process. Lett.
- 1993
POPS: An Application of Heuristic Search Methods to the Processing of a Nondeterministic Programming Language
- Computer Science
- IJCAI
- 1973
- 2
- PDF
Control Structure Abstractions of the Backtracking Programming Technique
- Computer Science
- IEEE Transactions on Software Engineering
- 1976
- 30
- PDF
An interpreter for a nondeterministic language
- Computer Science
- International Journal of Computer & Information Sciences
- 2004
Linear Time Simulation of Invertible Non-Deterministic Stack Algorithms
- Computer Science
- J. Univers. Comput. Sci.
- 1997
- PDF