The dimension of the negation of transitive closure (Q4842619): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A programming language for the inductive sets, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic generalized spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eventual periodicity and ``one-dimensional'' queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrization over inductive relations of a bounded number of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some restrictions on simple fixed points of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of model theoretic games to discrete linear orders and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / 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: Number of quantifiers is better than number of tape cells / rank
 
Normal rank

Latest revision as of 15:14, 23 May 2024

scientific article; zbMATH DE number 785330
Language Label Description Also known as
English
The dimension of the negation of transitive closure
scientific article; zbMATH DE number 785330

    Statements

    Identifiers

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