Relative complexity of checking and evaluating
- 1 May 1976
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 5 (1) , 20-23
- https://doi.org/10.1016/0020-0190(76)90097-1
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- General context-free recognition in less than cubic timeJournal of Computer and System Sciences, 1975
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965