Computing on structures (Q4630296): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Object identity as a query language primitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedural languages for database queries and updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog extensions for database queries and updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixpoint logics, relational machines, and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with infinitary logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moschovakis closure ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable queries for relational data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary logic and inductive definability over finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic generalized spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable networks and product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectra of First-Order Sentences and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal quantifiers and time complexity of random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point extensions of first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for first order expressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines and the spectra of first-order formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive characterizations of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive definitions over finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of fixed-point queries on binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formalised computer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: What are logical notions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between logics of programs and complexity theory / rank
 
Normal rank

Latest revision as of 23:42, 18 July 2024

scientific article; zbMATH DE number 7045147
Language Label Description Also known as
English
Computing on structures
scientific article; zbMATH DE number 7045147

    Statements

    Computing on structures (English)
    0 references
    0 references
    0 references
    29 March 2019
    0 references
    relational machine
    0 references
    generic machine
    0 references
    complexity class
    0 references
    query language
    0 references
    expressive power
    0 references
    predicate symbol
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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