Works matching IS 01290541 AND DT 1993 AND VI 4 AND IP 3

Results: 5
    1

    A NEW CHARACTERIZATION OF UNBREAKABLE GRAPHS.

    Published in:
    International Journal of Foundations of Computer Science, 1993, v. 4, n. 3, p. 193, doi. 10.1142/S0129054193000134
    By:
    • OLARIU, STEPHAN;
    • STEWART, IAIN A.
    Publication type:
    Article
    2

    COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION.

    Published in:
    International Journal of Foundations of Computer Science, 1993, v. 4, n. 3, p. 241, doi. 10.1142/S0129054193000158
    By:
    • LISITSA, ALEXEI P.
    Publication type:
    Article
    3
    4

    BANISHING ROBUST TURING COMPLETENESS.

    Published in:
    International Journal of Foundations of Computer Science, 1993, v. 4, n. 3, p. 245, doi. 10.1142/S012905419300016X
    By:
    • HEMASPAANDRA, LANE A.;
    • JAIN, SANJAY;
    • VERESHCHAGIN, NIKOLAI K.
    Publication type:
    Article
    5

    ON STEPWISE EXPLICIT SUBSTITUTION.

    Published in:
    International Journal of Foundations of Computer Science, 1993, v. 4, n. 3, p. 197, doi. 10.1142/S0129054193000146
    By:
    • KAMAREDDINE, FAIROUZ;
    • NEDERPELT, ROB
    Publication type:
    Article