Login / Signup
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
Joel Friedman
Published in:
CoRR (2006)
Keyphrases
</>
lower bound
upper bound
worst case
computational complexity
data structure
database
real valued
data sets
neural network
learning algorithm
case study
linear programming
branch and bound
boolean functions
lower and upper bounds
complexity measures