✦ LIBER ✦

Finite isomorphically complete systems

✍ Scribed by F. Gécseg; B. Imreh

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 505 KB
Volume: 36
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90261-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Profinite completions and isomorphic fin

Profinite completions and isomorphic finite quotients

✍ John D. Dixon; Edward W. Formanek; John C. Poland; Luis Ribes 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Isomorphically rigid algebras

✍ K. N. Ponomarev 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 191 KB

Completeness results for graph isomorphi

Completeness results for graph isomorphism

✍ Birgit Jenner; Johannes Köbler; Pierre McKenzie; Jacobo Torán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 239 KB

We prove that the graph isomorphism problem restricted to trees and to colored graphs with color multiplicities 2 and 3 is many-one complete for several complexity classes within NC 2 . In particular we show that tree isomorphism, when trees are encoded as strings, is NC 1 -hard under AC 0 -reductio

Testing homotopy equivalence is isomorph

Testing homotopy equivalence is isomorphism complete

✍ Yechezkel Zalcstein; Stanley P. Franklin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

The Complete Intersection Theorem for Sy

The Complete Intersection Theorem for Systems of Finite Sets

✍ Rudolf Ahlswede; Levon H. Khachatrian 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

An isomorphic factorization of the compl

An isomorphic factorization of the complete graph

✍ F. K. Hwang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

We give necessary and sufficient conditions that the complete graph K, has an isomorphic factorization into Kr X K,. We show that this factorization has an application to clone library screening.