๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Morphisms for the Maximum Weight Ideal Problem

โœ Scribed by L.H. Harper

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
244 KB
Volume
91
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tight Bounds for the Maximum Acyclic Sub
Tight Bounds for the Maximum Acyclic Subgraph Problem
โœ Bonnie Berger; Peter W Shor ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to ลฝ . find a maximum cardinality subset Aะˆ of the arcs such that Gะˆ s V, Aะˆ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given ลฝ any graph G without two-cycles, find an acyclic subgraph

On the Ideal Class Group Problem for Glo
On the Ideal Class Group Problem for Global Fields
โœ Marc Perret ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB

We prove that any finite abelian group is the ideal class group of the ring of S-integers of some global field of given characteristic. ## 1999 Academic Press Nous prouvons que tout groupe abe lien fini est groupe des classes d'ide aux de l'anneau des S-entiers d'un corps global de caracte ristiqu