Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!ukc!strath-cs!cs.glasgow.ac.uk!rwi
From: rwi@cs.glasgow.ac.uk (Dr Rob Irving)
Newsgroups: comp.theory
Subject: Re: Finding subsets of equations
Summary: Using bipartite matching to identify solvable sets of equations
Message-ID: <5391@vanuata.cs.glasgow.ac.uk>
Date: 4 Jun 90 09:38:58 GMT
References: <74444@aerospace.AERO.ORG>
Organization: Computing Sci, Glasgow Univ, Scotland
Lines: 8

In article <74444@aerospace.AERO.ORG>, abbott@aerospace.aero.org (Russell J. Abbott) writes:

> Does anyone have or know of a solution to the following problem?
> Suppose you have n equations in m unknowns, m > n and want to find a
> subset of those equations in which the number of unknowns is no greater
> than the number of equations.  Is there a way to do that without a brute
> force search through all possible combinations of equations with common
> unknowns?