Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds.
Robert FerensMarek SzykulaPublished in: ICALP (2023)
Keyphrases
- objective function
- upper bound
- worst case
- cost function
- preprocessing
- computational complexity
- dynamic programming
- optimal solution
- detection algorithm
- segmentation algorithm
- computational cost
- upper and lower bounds
- lower and upper bounds
- theoretical analysis
- lower bound
- optimization algorithm
- particle swarm optimization
- neural network
- np hard
- significant improvement
- k means
- search space
- expectation maximization
- ant colony optimization
- matching algorithm
- convex hull
- approximation algorithms
- pairwise
- constant factor