Login / Signup
A Near-Optimal Expected Boolean Complexity Bound for Descartes Solver.
Alperen Ali Ergür
Josué Tonelli-Cueto
Elias P. Tsigaridas
Published in:
CoRR (2022)
Keyphrases
</>
worst case
lower bound
upper bound
databases
real time
neural network
data mining
evolutionary algorithm
special case
computational cost
orders of magnitude
boolean functions
vc dimension
boolean formula
expected error