NP-completeness of a combinator optimization problem (Q1903594)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 824606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of a combinator optimization problem |
scientific article; zbMATH DE number 824606 |
Statements
NP-completeness of a combinator optimization problem (English)
0 references
13 May 1996
0 references
deterministic rewrite system
0 references
combinatory logic
0 references
normal form
0 references
lambda- expression
0 references
NP-complete
0 references
0.9151982
0 references
0.8968295
0 references
0.89486027
0 references
0 references
0.89015824
0 references
0.88947433
0 references
