23 search results - page 2 / 5 » A characterization of quadrics by intersection numbers |
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
This article studies the small weight codewords of the functional code CHerm(X), with X a non-singular Hermitian variety of PG(N, q2). The main result of this article is that the ...
APAL
2007
13 years 8 months ago
2007
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
ENDM
2008
13 years 8 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
COCOON
2003
Springer
14 years 1 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...