Unification algorithms cannot be combined in polynomial time. (Q1854364)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unification algorithms cannot be combined in polynomial time. |
scientific article; zbMATH DE number 1853121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unification algorithms cannot be combined in polynomial time. |
scientific article; zbMATH DE number 1853121 |
Statements
Unification algorithms cannot be combined in polynomial time. (English)
0 references
14 January 2003
0 references
complexity class
0 references
counting problems
0 references
0 references
0 references
0 references
