We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Remove filter Computer science

Search Results

Showing 1-4 of 4 results
  1. Article

    Representing and solving finite-domain constraint problems using systems of polynomials

    In this paper we investigate the use of a system of multivariate polynomials to represent the restrictions imposed by a collection of constraints....

    Christopher Jefferson, Peter Jeavons, ... M. R. C. van Dongen in Annals of Mathematics and Artificial Intelligence
    01 March 2013
  2. Article

    Affine cartesian codes

    We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given...

    Hiram H. López, Carlos Rentería-Márquez, Rafael H. Villarreal in Designs, Codes and Cryptography
    17 June 2012
  3. Article

    The minimum distance of parameterized codes on projective tori

    Let X be a subset of a projective space, over a finite field K , which is parameterized by the monomials arising from the edges of a clutter. Let I ( X )...

    Eliseo Sarmiento, Maria Vaz Pinto, Rafael H. Villarreal in Applicable Algebra in Engineering, Communication and Computing
    11 August 2011
  4. Article

    Mincut ideals of two-terminal networks

    This paper introduces mincut ideals of two-terminal networks, which arise in the algebraic analysis of system reliability. We give the definitions...

    Eduardo Sáenz-de-Cabezón, Henry P. Wynn in Applicable Algebra in Engineering, Communication and Computing
    20 October 2010
Did you find what you were looking for? Share feedback.