We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...