Login / Signup
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits.
Vikraman Arvind
Abhranil Chatterjee
Rajit Datta
Partha Mukhopadhyay
Published in:
Electron. Colloquium Comput. Complex. (2018)
Keyphrases
</>
brute force
special case
computationally expensive
high speed
search quality
search engine
data structure
search algorithm
computational complexity
data points
simulated annealing
similarity search
exhaustive search
candidate set
algebraic geometry