Searching for "A Combinatorial Theorem." – sorted by Relevance.
31 documents found, showing 1 through 10.
Next 10 →
-
A combinatorial theorem on systems of sets
- …A COMBINATORIAL THEOREM ON SYSTEMS OF SETS E. C. MILNER 1. Introduction Small letters denote non…
- Cited by 10 (0 self) – Add To MetaCart
-
Representing Embeddability As Set Inclusion
- …. We shall need the following combinatorial tool: 0.3 Theorem:(Shelah) If ? is regular, a cardinal…
- Cited by 3 (1 self) – Add To MetaCart
-
Combinatorial analogs of Brouwer’s fixed point theorem on a bounded polyhedron
- …Combinatorial Analogs of Brouwer's Fixed Point Theorem on a Bounded Polyhedron by Robert M. Freund…
- Cited by 1 (0 self) – Add To MetaCart
-
Watermarking of SAT using Combinatorial Isolation Lemmas
- … credibility and fairness requirements. Leveraging on a combinatorial theorem of Valiant and Vazirani, we…
- Cited by 1 (1 self) – Add To MetaCart
-
Finite Algebras of Relations Are Representable on Finite Sets
- …'emeti 13 December 1996 Abstract Using a combinatorial theorem of Herwig on extending partial isomorphisms…
- Cited by 18 (2 self) – Add To MetaCart
-
Decidability of Cylindric Set Algebras of Dimension Two and First-Order Logic With Two Variables
- … (without function symbols), using a combinatorial theorem due to Herwig. The results are proved…
- Cited by 2 (0 self) – Add To MetaCart
-
When trees collide: An approximation algorithm for the generalized Steiner problem on networks.
- … approximate min-max equality At the heart of our proofs of near-optimality is a combinatorial theorem…
- Cited by 157 (28 self) – Add To MetaCart
-
Limitations of Non-Uniform Computational Models
- … nontrivial cell probe lower bound has, at its core, a combinatorial theorem. To support this claim, we shall…
- Add To MetaCart
-
The shortest vector in a lattice is hard to approximate to within some constant
- …. Section 7 concludes with remarks and open problems. In section 5 we use a combinatorial theorem (Theorem 5…
- Cited by 38 (3 self) – Add To MetaCart
-
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant*
- … and openproblems. In section 5 we use a combinatorial theorem (Theorem 4) similar to a result originally proved…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
