\(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3992552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query languages for hierarchic databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local class field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable query languages for complex object databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolving Algebras 1993: Lipari Guide / 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: The expressiveness of a family of finite set languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fine structure of the constructible hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of formulas in set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening of the theorems on polynomial queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and feasibility in arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical-functional approach to data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3927239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The collection principle and the existential quantifier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditarily-finite sets, data bases and polynomial-time computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalence between polynomial constructivity of Markov's principle and \(P=NP\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815544 / rank
 
Normal rank

Latest revision as of 13:23, 28 May 2024

scientific article
Language Label Description Also known as
English
\(\Delta\)-languages for sets and LOGSPACE computable graph transformers
scientific article

    Statements

    \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (English)
    0 references
    23 July 1998
    0 references
    0 references
    acyclic graphs
    0 references
    relational databases
    0 references
    0 references
    0 references