Number of the records: 1  

Proof Complexity and Feasible Arithmetic

    1.
    SYSNO ASEP0174516
    Document TypeM - Monograph Chapter
    R&D Document TypeMonograph Chapter
    TitleAlgebraic models of computation and interpolation for algebraic proof systems
    Author(s) Pudlák, Pavel (MU-W) RID, SAI
    Sgall, Jiří (MU-W) RID, ORCID, SAI
    Source TitleProof Complexity and Feasible Arithmetic / Buss S.R.. - New York : AMS, 1998
    Pagess. 279-296
    Number of pages296 s.
    Languageeng - English
    CountryUS - United States
    Subject RIVBA - General Mathematics BA - General Mathematics
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing1999

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.

Accept allSettingsReject all