✦ LIBER ✦

The complexity space of a valued linearly ordered set

✍ Scribed by S. Romaguera; E.A. Sánchez-Pérez; O. Valero

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 191 KB
Volume: 74
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80772-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The embedding of linearly ordered sets

✍ A. G. Pinus 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 248 KB

The Complexity of Querying Indefinite Da

The Complexity of Querying Indefinite Data about Linearly Ordered Domains

✍ Ron van der Meyden 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 969 KB

In applications dealing with ordered domains, the available data is frequently indefinite. While the domain is actually linearly ordered, only some of the order relations holding between points in the data are known. Thus, the data provides only a partial order, and query answering involves determin

Characterization of the category of line

Characterization of the category of linearly ordered sets

✍ A. G. Pinus 📂 Article 📅 1982 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 438 KB

The projection operator for a space span

The projection operator for a space spanned by a linearly dependent set

✍ Manuel Berrondo; Per-Olov Löwdin 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB

New proof of the solvability of the elem

New proof of the solvability of the elementary theory of linearly ordered sets

✍ N. K. Vereshchagin 📂 Article 📅 1990 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 468 KB

The contraction principle for set valued

The contraction principle for set valued mappings on a metric space with a graph

✍ Ismat Beg; Asma Rashid Butt; S. Radojević 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 305 KB

Let (X, d) be a metric space and F : X ; X be a set valued mapping. We obtain sufficient conditions for the existence of a fixed point of the mapping F in the metric space X endowed with a graph G such that the set V (G) of vertices of G coincides with X and the set of edges of G is E(G) = {(x, y) :