Improving the efficiency of non-deterministic computations
From MaRDI portal
Recommendations
- Using nondeterminism to design efficient deterministic algorithms
- Improving lazy non-deterministic computations by demand analysis
- scientific article; zbMATH DE number 2068877
- On nondeterminism in parallel computation
- Improved simulation of nondeterministic Turing machines
- Improved simulation of nondeterministic Turing machines
- Nondeterministic NC^1 computation
- IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
Cites work
- An approach to declarative programming based on a rewriting logic
- scientific article; zbMATH DE number 1630028 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1088020 (Why is no real title available?)
- scientific article; zbMATH DE number 1973220 (Why is no real title available?)
- Kernel-LEAF: A logic plus functional language
- Logic programming with functions and predicates: The language Babel
- Nondeterministic algebraic specifications and nonconfluent term rewriting
Cited in
(6)- A Fully Abstract Semantics for Constructor Systems
- scientific article; zbMATH DE number 1942455 (Why is no real title available?)
- Improving lazy non-deterministic computations by demand analysis
- Singular and plural functions for functional logic programming
- Speedup for natural problems and noncomputability
- Ensuring the quasi-termination of needed narrowing computations
This page was built for publication: Improving the efficiency of non-deterministic computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841287)
