The complexity of random ordered structures (Q2478557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A zero‐one law for a random subset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How complex are random graphs in first order logic? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities of First-Order Sentences about Unary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-One Laws for Sparse Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strange logic of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tenacity of zero-one laws / rank
 
Normal rank

Latest revision as of 20:26, 27 June 2024

scientific article
Language Label Description Also known as
English
The complexity of random ordered structures
scientific article

    Statements

    The complexity of random ordered structures (English)
    0 references
    0 references
    0 references
    28 March 2008
    0 references
    random graphs
    0 references
    first-order logic
    0 references
    Ehrenfeucht-Fraisse games
    0 references

    Identifiers