Lower bounds for linear satisfiability problems
Published • Jan 22, 1995
NobleIDNI2P47W02R16S29
Authors:
Jeff Erickson
Abstract
We prove an \\Omega\\Gamma n dr=2e ) lower bound for the following problem: For some fixed linear equation in r variables, given n real numbers, do any r of them satisfy the equation? Our lower bound holds in a restricted linear decision tree model, in which each decision is based on the sign of an ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!