Computational complexity and constraint logic programming languages
From MaRDI portal
Recommendations
Cites work
- A canonical form for generalized linear constraints
- Alternation
- Alternation and the computational complexity of logic programs
- CAL: A theoretical background of constraint logic programming and its applications
- Complete problems for deterministic polynomial time
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 16648 (Why is no real title available?)
- scientific article; zbMATH DE number 192840 (Why is no real title available?)
- Linear unification
Cited in
(4)
This page was built for publication: Computational complexity and constraint logic programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354033)