Bokus

S.R. Buss – författare

Visar alla böcker från författaren S.R. Buss. Handla med fri frakt och snabb leverans.

4 produkter

  1. S.R. Buss - Handbook of Proof Theory, E-bok. Tillgänglighet: Lägg i varukorg

    Handbook of Proof Theory

    Av S.R. Buss

    E-bok, 1998

    2363 kr

    Lägg i varukorg

    This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer …

  2. Samuel R. Buss, S. R. Buss, S.R. Buss - Handbook of Proof Theory, Inbunden. Tillgänglighet: Lägg i varukorg

    Handbook of Proof Theory

    Av Samuel R. Buss, S. R. Buss m. fl.

    Inbunden, 1998

    1739 kr

    Lägg i varukorg

    This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer …

  3. S.R. Buss, P.J. Scott - Feasible Mathematics, Häftad. Tillgänglighet: Lägg i varukorg

    Feasible Mathematics

    A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

    Av S.R. Buss, P.J. Scott

    Häftad, 1990

    552 kr

    Lägg i varukorg

    A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible …

  4. P.J. Scott, S.R. Buss - Feasible Mathematics, E-bok. Tillgänglighet: Lägg i varukorg

    Feasible Mathematics

    A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

    Av P.J. Scott, S.R. Buss

    E-bok, 2013

    734 kr

    Lägg i varukorg

    A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible …