Complexity Issues for Preorders on Finite Labeled Forests (Q3091446): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1571189667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Choice and Boundedness Principles in Computable Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weihrauch degrees, omniscience principles and weak computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-partitions over posets with an application to reducing the set of solutions of NP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gandy Theorem for Abstract Structures and Applications to First-Order Definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability in Weihrauch Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the homomorphism order of labeled posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled posets are universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Δ<sup>0</sup><sub>2</sub>‐measurable <i>k</i> ‐partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank

Latest revision as of 10:19, 4 July 2024

scientific article
Language Label Description Also known as
English
Complexity Issues for Preorders on Finite Labeled Forests
scientific article

    Statements

    Identifiers