Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:33, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear ordering on graphs, anti-founded sets and polynomial time computability |
scientific article |
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
