Bokus

J. Flum – författare

Visar alla böcker från författaren J. Flum. Handla med fri frakt och snabb leverans.

5 produkter

  1. H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas - Mathematical Logic, Inbunden. Tillgänglighet: Lägg i varukorg

    Mathematical Logic

    Av H.-D. Ebbinghaus, J. Flum m. fl.

    Inbunden, 1994

    895 kr

    Lägg i varukorg

    What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathe­ matical proofs? Only in this century has there been success in obtaining substantial and satisfactory answers. The present book contains a systematic …

  2. Wolfgang Thomas, J. Flum, H.-D. Ebbinghaus - Mathematical Logic, E-bok. Tillgänglighet: Lägg i varukorg

    Mathematical Logic

    Av Wolfgang Thomas, J. Flum m. fl.

    E-bok, 2013

    880 kr

    Lägg i varukorg

    What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathe­ matical proofs? Only in this century has there been success in obtaining substantial and satisfactory answers. The present book contains a systematic …

  3. J. Flum, M. Grohe - Parameterized Complexity Theory, Inbunden. Tillgänglighet: Lägg i varukorg

    Parameterized Complexity Theory

    Av J. Flum, M. Grohe

    Inbunden, 2006

    1338 kr

    Lägg i varukorg

    Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a …

  4. M. Grohe, J. Flum - Parameterized Complexity Theory, E-bok. Tillgänglighet: Lägg i varukorg

    Parameterized Complexity Theory

    Av M. Grohe, J. Flum

    E-bok, 2006

    1214 kr

    Lägg i varukorg

    Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a …

  5. J. Flum, M. Grohe - Parameterized Complexity Theory, Häftad. Tillgänglighet: Lägg i varukorg

    Parameterized Complexity Theory

    Av J. Flum, M. Grohe

    Häftad, 2010

    923 kr

    Lägg i varukorg

    Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a …