Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!tut.cis.ohio-state.edu!ucbvax!AEROSPACE.AERO.ORG!abbott
From: abbott@AEROSPACE.AERO.ORG ("Russell J. Abbott")
Newsgroups: comp.theory
Subject: Finding subsets of equations
Message-ID: <9006011620.AB05047@irt.watson.ibm.com>
Date: 1 Jun 90 16:20:48 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: "Russell J. Abbott" <abbott%aerospace.aero.org@VM1.NoDak.EDU>
Organization: The Aerospace Corporation, El Segundo, CA
Lines: 6

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?