6 research outputs found

    On a complexity of the formula (A ⋁ B) ⇒ C

    Get PDF
    AbstractBy the complexity KF(Ω) of the formula Ω: (A ⋁ B) ⇒ C we mean the minimal length of a program which on input 〈0, A〉 outputs C and on input 〈1, B〉 outputs C. We prove that there exist words A, B, C such that KF(Ω) is close to K(C©A) + K(C©B)

    Modern Trends of Organic Chemistry in Russian Universities

    No full text
    corecore