Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431)
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 4151805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming |
scientific article; zbMATH DE number 4151805 |
Statements
Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (English)
0 references
1990
0 references
halting problem
0 references
complexity problems
0 references
logic programs
0 references
structured logic programming
0 references
0 references
0.7828061580657959
0 references
