S.-G. Mancivi, Sharply bounded predicates do not exhaust the polynomial time computable predicates, parts I&II. Typeset manuscript, 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Graph of Multiplication is Equivalent to Counting - Buss (1991) (9 citations) (Correct)
No context found.
S.-G. Mancivi, Sharply bounded predicates do not exhaust the polynomial time computable predicates, parts I&II. Typeset manuscript, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC