A faster algorithm for testing polynomial representability of functions over finite integer rings.
Ashwin GuhaAmbedkar DukkipatiPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- detection algorithm
- preprocessing
- theoretical analysis
- experimental evaluation
- optimization algorithm
- computational complexity
- input data
- high accuracy
- computational cost
- np hard
- neural network
- dynamic programming
- significant improvement
- optimal solution
- cost function
- search space
- graph cuts
- computationally efficient
- segmentation algorithm
- bayesian networks
- data sets
- times faster
- improved algorithm
- minimum cost flow
- filled function method