On the Computational Complexity of Optimal Sorting Network Verification.
Ian ParberryPublished in: PARLE (1) (1991)
Keyphrases
- computational complexity
- worst case
- optimal solution
- complex networks
- memory requirements
- computer networks
- computational cost
- neural network
- np hard
- special case
- link prediction
- network model
- exhaustive search
- formal verification
- network parameters
- optimal path
- face verification
- optimal design
- data flow
- community structure
- low complexity
- model checking
- bit rate