Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version)
Janos SimonPublished in: STOC (1981)
Keyphrases
- preliminary version
- turing machine
- complexity measures
- probabilistic model
- low dimensional
- tractable cases
- computational complexity
- space requirements
- equivalence classes
- data sets
- class labels
- higher dimensional
- space time
- generative model
- search space
- neural network
- probabilistic reasoning
- uncertain data
- complexity analysis
- bayesian networks
- training data