Checking identities is computationally intractable NP-hard and therefore human provers will always be needed (Q3156861)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking identities is computationally intractable NP-hard and therefore human provers will always be needed |
scientific article |
Statements
Checking identities is computationally intractable NP-hard and therefore human provers will always be needed (English)
0 references
12 January 2005
0 references
