Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs.
Ivan KramosilPublished in: Kybernetika (1981)
Keyphrases
- propositional calculus
- pseudorandom
- computational complexity
- uniformly distributed
- random number
- special case
- statistical tests
- np complete
- statistical analysis
- computationally efficient
- secret key
- decision problems
- test cases
- high computational complexity
- statistical methods
- data sets
- statistical models
- information theoretic
- computational efficiency
- computational cost
- np hard