Separating NOF communication complexity classes RP and NP.
Matei DavidToniann PitassiPublished in: Electron. Colloquium Comput. Complex. (2008)
Keyphrases
- computational complexity
- tractable cases
- complexity measures
- np complete
- worst case
- communication networks
- objective function
- decision problems
- communication protocol
- real time
- search algorithm
- special case
- computational cost
- case study
- database
- class labels
- data acquisition
- space complexity
- data sets
- intrinsic complexity