On Fri, 14 Jan 2005, Michael Matsko wrote:
Dimitri
Matriods are generalization of vector spaces. Basically, they are
defined by a set of linear dependence axioms and basis exchange
properties. Oxley's Matriod Theory is the standard reference. There
are a multitude of equivalent
Thanks!
--
Dmitri Pissarenko
Software Engineer
http://dapissarenko.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Message -
From: Dmitri Pissarenko [EMAIL PROTECTED]
Date: Friday, January 14, 2005 2:00 pm
Subject: Re: [Haskell-cafe] Matroids in Haskell
Hello!
Gerhard Navratil wrote:
Recently I had a course on matroids and would like to investigate
the topic a little further. Did anybody write
Recently I had a course on matroids and would like to investigate the
topic a little further. Did anybody write (or start writing) a
Haskell-implementation for matroids?
It would save me some time figuring out if this part of mathematics is
useful for my work ...
Thanks in advance,
Gerhard
On Fri, 14 Jan 2005, Gerhard Navratil wrote:
Recently I had a course on matroids and would like to investigate the
topic a little further. Did anybody write (or start writing) a
Haskell-implementation for matroids?
Do you mean a Matroid type class?
Hello!
Gerhard Navratil wrote:
Recently I had a course on matroids and would like to investigate the
topic a little further. Did anybody write (or start writing) a
Haskell-implementation for matroids?
What is a matroid?
Thanks
Dmitri Pissarenko
--
Dmitri Pissarenko
Software Engineer