Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423)
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 1387350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear ordering on graphs, anti-founded sets and polynomial time computability |
scientific article; zbMATH DE number 1387350 |
Statements
Linear ordering on graphs, anti-founded sets and polynomial time computability (English)
0 references
12 January 2000
0 references
descriptive complexity
0 references
capturing PTIME
0 references
linear ordering
0 references
strongly extensional graphs
0 references
bisimulation
0 references
anti-foundation axiom
0 references
bounded set theory
0 references
0 references
0.7098373174667358
0 references
0.7080826163291931
0 references
0.7002008557319641
0 references
