On the Quantifier-Free Dynamic Complexity of Reachability (Q2849966): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import recommendations run Q6767936
 
Property / Recommended article
 
Property / Recommended article: On the quantifier-free dynamic complexity of reachability / rank
 
Normal rank
Property / Recommended article: On the quantifier-free dynamic complexity of reachability / qualifier
 
Similarity Score: 1.0
Amount1.0
Unit1
Property / Recommended article: On the quantifier-free dynamic complexity of reachability / qualifier
 
Property / Recommended article
 
Property / Recommended article: Dynamic Complexity of Directed Reachability and Other Problems / rank
 
Normal rank
Property / Recommended article: Dynamic Complexity of Directed Reachability and Other Problems / qualifier
 
Similarity Score: 0.9079727
Amount0.9079727
Unit1
Property / Recommended article: Dynamic Complexity of Directed Reachability and Other Problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: Dynamic Complexity of the Dyck Reachability / rank
 
Normal rank
Property / Recommended article: Dynamic Complexity of the Dyck Reachability / qualifier
 
Similarity Score: 0.903247
Amount0.903247
Unit1
Property / Recommended article: Dynamic Complexity of the Dyck Reachability / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the Complexity of L-reachability / rank
 
Normal rank
Property / Recommended article: On the Complexity of L-reachability / qualifier
 
Similarity Score: 0.895306
Amount0.895306
Unit1
Property / Recommended article: On the Complexity of L-reachability / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the Complexity of L-reachability* / rank
 
Normal rank
Property / Recommended article: On the Complexity of L-reachability* / qualifier
 
Similarity Score: 0.8953059
Amount0.8953059
Unit1
Property / Recommended article: On the Complexity of L-reachability* / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3203003 / rank
 
Normal rank
Property / Recommended article: Q3203003 / qualifier
 
Similarity Score: 0.8799035
Amount0.8799035
Unit1
Property / Recommended article: Q3203003 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Complexity of reachability problems for finite discrete dynamical systems / rank
 
Normal rank
Property / Recommended article: Complexity of reachability problems for finite discrete dynamical systems / qualifier
 
Similarity Score: 0.8734211
Amount0.8734211
Unit1
Property / Recommended article: Complexity of reachability problems for finite discrete dynamical systems / qualifier
 
Property / Recommended article
 
Property / Recommended article: The Cost of Exactness in Quantitative Reachability / rank
 
Normal rank
Property / Recommended article: The Cost of Exactness in Quantitative Reachability / qualifier
 
Similarity Score: 0.872136
Amount0.872136
Unit1
Property / Recommended article: The Cost of Exactness in Quantitative Reachability / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction / rank
 
Normal rank
Property / Recommended article: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction / qualifier
 
Similarity Score: 0.86999315
Amount0.86999315
Unit1
Property / Recommended article: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction / qualifier
 

Latest revision as of 23:48, 5 May 2025

scientific article
Language Label Description Also known as
English
On the Quantifier-Free Dynamic Complexity of Reachability
scientific article

    Statements

    On the Quantifier-Free Dynamic Complexity of Reachability (English)
    0 references
    0 references
    0 references
    20 September 2013
    0 references

    Identifiers