30 research outputs found

    Solving Łukasiewicz <i>μ</i>-terms

    Get PDF

    Tree Breadth of the Continued Fractions Root Finding Method

    Get PDF

    Parametrised Gröbner-Shirshov Bases

    Get PDF

    Types of Depth and Formula Size

    Get PDF

    Leadership in Compassionate Care: Final Report 2012

    Get PDF
    This report reflects the initiation, planning, running and the important outcomes emerging from the Leadership in Compassionate Care Programme. The team worked in close partnership across the School of Nursing, Midwifery and Social Care, Edinburgh Napier University and NHS Lothian. This report also shares the highlights, challenges and solutions to embed compassionate care education and nursing practice.Additional co-authors: Fiona Smith, Stephen DM Smith, Ria Tocher, and Anne Waug

    Counting and Gröbner Bases

    Get PDF
    We show how the complexity of counting relates to the well known phenomenon that computing Gröbner bases under a lexicographic order is generally harder than total degree orders. We give simple examples of polynomials for which it is very easy to compute their Gröbner basis using a total degree order but for which exponential time is required for a lexicographic order. It follows that conversion algorithms do not help in such cases

    Schenck, H.

    No full text

    Decision problems in group theory

    No full text
    At the 1976 Oxford Conference, Aanderaa introduced a new class of machines which he called F machines (later renamed as modular machines). Using these he gave two remarkably short and easy examples of finitely presented groups with unsolvable word problem. Both of these examples, together with an exposition of modula

    Decision Problems in Group Theory

    No full text
    corecore