✦ LIBER ✦

A Theorem of Isomorphism

✍ Scribed by Harte, R. E.

Book ID: 120102217
Publisher: Oxford University Press
Year: 1966
Tongue: English
Weight: 287 KB
Volume: s3-16
Category: Article
ISSN: 0024-6115
DOI: 10.1112/plms/s3-16.1.753

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An isomorphism theorem

✍ Franklin, Stanley P. 📂 Article 📅 1968 🏛 Springer-Verlag 🌐 English ⚖ 149 KB

A First-Order Isomorphism Theorem

✍ Allender, Eric; Balcázar, José; Immerman, Neil 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 292 KB

A 2-Isomorphism Theorem for Hypergraphs

✍ Dirk Vertigan; Geoff Whittle 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 330 KB

One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising wh

Isomorphic extension theorem

✍ A. I. Pilatovskaya 📂 Article 📅 1970 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 107 KB

The norm residue isomorphism theorem

✍ Weibel, C. 📂 Article 📅 2009 🏛 Oxford University Press 🌐 English ⚖ 407 KB

Reductions in Circuit Complexity: An Iso

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem

✍ Manindra Agrawal; Eric Allender; Steven Rudich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 496 KB

We show that all sets that are complete for NP under nonuniform AC 0 reductions are isomorphic under nonuniform AC 0 -computable isomorphisms. Furthermore, these sets remain NP-complete even under nonuniform NC 0 reductions. More generally, we show two theorems that hold for any complexity class C c