Linear constraint query languages expressive power and complexity (Q6064293): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Euler and Hamilton Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of elementary algebra and geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable queries for relational data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relational model of data for large shared data banks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely representable databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for recursive data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of the relational algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Queries on Finite Structures Over the Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sentences true in all constructive models / rank
 
Normal rank

Latest revision as of 13:27, 21 August 2024

scientific article; zbMATH DE number 7776732
Language Label Description Also known as
English
Linear constraint query languages expressive power and complexity
scientific article; zbMATH DE number 7776732

    Statements

    Linear constraint query languages expressive power and complexity (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2023
    0 references
    0 references
    Boolean function
    0 references
    linear constraint
    0 references
    atomic formula
    0 references
    relational algebra
    0 references
    disjunctive normal form
    0 references
    0 references