Number of the records: 1  

A sorting network in bounded arithmetic

  1. 1.
    0353276 - MÚ 2011 RIV NL eng J - Journal Article
    Jeřábek, Emil
    A sorting network in bounded arithmetic.
    Annals of Pure and Applied Logic. Roč. 162, č. 4 (2011), s. 341-355. ISSN 0168-0072. E-ISSN 1873-2461
    R&D Projects: GA AV ČR IAA1019401; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : bounded arithmetic * sorting network * proof complexity * monotone sequent calculus
    Subject RIV: BA - General Mathematics
    Impact factor: 0.450, year: 2011
    http://www.sciencedirect.com/science/article/pii/S0168007210001272

    We formalize the construction of Paterson’s variant of the Ajtai–Komlós–Szemerédi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 (an extension of VNC1), under the assumption of the existence of suitable expander graphs. We derive a conditional p-simulation of the propositional sequent calculus in the monotone sequent calculus MLK.
    Permanent Link: http://hdl.handle.net/11104/0192567

     
    FileDownloadSizeCommentaryVersionAccess
    Jerabek.pdf1306.7 KBPublisher’s postprintrequire
     
Number of the records: 1  

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