First-order queries on structures of bounded degree are computable with constant delay (Q5277786)

From MaRDI portal
scientific article; zbMATH DE number 6744029
Language Label Description Also known as
English
First-order queries on structures of bounded degree are computable with constant delay
scientific article; zbMATH DE number 6744029

    Statements

    First-order queries on structures of bounded degree are computable with constant delay (English)
    0 references
    0 references
    0 references
    12 July 2017
    0 references
    computational complexity
    0 references
    enumeration problems
    0 references
    first-order logic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references