Complexity Hierarchies beyond Elementary (Q2828216): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q130988297, #quickstatements; #temporary_batch_1733737407418
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3125224867 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.5686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of the expressive power of well-structured transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizing well quasi-orders and bounding the length of bad sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the verification problem for weak memory models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Logics with Rational Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds for lengths of reductions in typed <i>λ</i>-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Coverability Graphs of Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On termination and invariance for faulty channel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable channels are easier to verify than perfect channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ω-Regular Post Embedding Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal recursive bounds for Higman's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite containment problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Freeze LTL with Ordered Attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal complexity of recursive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifications of Recursive Functions by Means of Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating register automata on finite words and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating timed and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future-Looking Logics on Data Words and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5824357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Priority Channel Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equality problem for vector addition systems is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Senescent ground tree rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propositional modal logic of time intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace Inclusion for One-Counter Nets Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of bisimilarity for Petri nets and some related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonprimitive recursive complexity and undecidability for Petri net equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on data trees and XPath satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametric Ordinal-Recursive Complexity of Post Embedding Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Post embedding problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure to decide reachability in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonelementary Complexities for Branching VASS, MELL, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector addition system reachability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demystifying Reachability in Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and large finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability and complexity of Metric Temporal Logic over finite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Predictably Computable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of recursive functions based on Ackermann's function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply-Recursive Upper Bounds with Higman’s Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Well-Structured Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typed lambda-calculus is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pebble automata for data languages with decidable emptiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: History-Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of entailment and relevant implication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of decision procedures in relevance logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most nonelementary theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of the ordinal recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for some finite forms of Kruskal's theorem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130988297 / rank
 
Normal rank

Latest revision as of 10:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity Hierarchies beyond Elementary
scientific article

    Statements

    Complexity Hierarchies beyond Elementary (English)
    0 references
    0 references
    24 October 2016
    0 references
    fast-growing complexity
    0 references
    subrecursion
    0 references
    well-quasi-order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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