NP-completeness of a combinator optimization problem
From MaRDI portal
Publication:1903594
Recommendations
- NP-completeness of the linear complementarity problem
- scientific article; zbMATH DE number 6832021
- scientific article; zbMATH DE number 1944142
- NP for Combinatorialists
- Optimization and \(\mathrm{NP}_{\mathbb{R}}\)-completeness of certain fewnomials
- Inapproximability of combinatorial optimization problems
- scientific article; zbMATH DE number 847149
- Decidability of NP-complete problems
- The complexity of some complementation problems
- COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS
Cites work
- scientific article; zbMATH DE number 4060679 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3518770 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- A new implementation technique for applicative languages
- Another algorithm for bracket abstraction
- Combinatory logic. Vol. II
- Combinatory logic. With two sections by William Craig.
- The lambda calculus, its syntax and semantics
Cited in
(10)- LaserTank is NP-Complete
- NP-completeness of the Hamming salesman problem
- Max NP-completeness made easy
- On the complexity of alpha conversion
- scientific article; zbMATH DE number 6832021 (Why is no real title available?)
- A Natural NP-Complete Problem with a Nontrivial Lower Bound
- Metaheuristics: A bibliography
- NP-completeness of some optimal sequencing problems with a given grouping of elements
- Combinatorial flexibility problems and their computational complexity
- scientific article; zbMATH DE number 958366 (Why is no real title available?)
This page was built for publication: NP-completeness of a combinator optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903594)
