Search results

Records found: 40  
Your query: Author Sysno/Doc.kind = "^cav_un_auth 0100670 zj^"
    1.
    0430340 - MÚ 2015 RIV GB eng J - Journal Article
    Krajíček, Jan
    On the computational complexity of finding hard tautologies.
    Bulletin of the London Mathematical Society. Roč. 46, č. 1 (2014), s. 111-125. ISSN 0024-6093. E-ISSN 1469-2120
    R&D Projects: GA AV ČR IAA100190902
    Keywords : computational complexity * propositional proof systems
    Subject RIV: BA - General Mathematics
    Impact factor: 0.704, year: 2014
    http://blms.oxfordjournals.org/content/46/1/111
    Permanent Link: http://hdl.handle.net/11104/0235340
    FileDownloadSizeCommentaryVersionAccess
    Krajicek.pdf1215.2 KBPublisher’s postprintrequire
     
     
    2.
    0402831 - UIVT-O 980007 RIV PL eng J - Journal Article
    Baaz, M. - Hájek, Petr - Krajíček, Jan - Švejda, David
    Embedding Logics into Product Logic.
    Studia Logica. Roč. 61, č. 1 (1998), s. 35-47. ISSN 0039-3215. E-ISSN 1572-8730
    R&D Projects: GA AV ČR IAA1030601
    Grant - others:COST(XE) Action 15
    Keywords : fuzzy logic * Lukasiewicz logic * Gödel logic * product logic * computational complexity * arithmetical hierarchy
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0123207
    FileDownloadSizeCommentaryVersionAccess
    a0402831.pdf2580.4 KBPublisher’s postprintrequire
     
     
    3.
    0395501 - MÚ 2014 RIV DE eng J - Journal Article
    Krajíček, Jan
    A saturation property of structures obtained by forcing with a compact family of random variables.
    Archive for Mathematical Logic. Roč. 52, 1-2 (2013), s. 19-28. ISSN 0933-5846. E-ISSN 1432-0665
    R&D Projects: GA AV ČR IAA100190902
    Keywords : Boolean-valued structures * saturation property * non-standard model of arithmetic
    Subject RIV: BA - General Mathematics
    Impact factor: 0.324, year: 2013
    http://link.springer.com/article/10.1007%2Fs00153-012-0304-9
    Permanent Link: http://hdl.handle.net/11104/0223523
    FileDownloadSizeCommentaryVersionAccess
    Krajicek.pdf4173.3 KBPublisher’s postprintrequire
     
     
    4.
    0385494 - MÚ 2013 RIV DE eng J - Journal Article
    Krajíček, Jan
    Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator.
    Logical Methods in Computer Science. Roč. 8, č. 3 (2012), 09. ISSN 1860-5974. E-ISSN 1860-5974
    R&D Projects: GA AV ČR IAA100190902
    Keywords : Nisan-Wigderson generator * interactive computation * hard core
    Subject RIV: BA - General Mathematics
    Impact factor: 0.440, year: 2012
    http://www.lmcs-online.org/ojs/viewarticle.php?id=1134&layout=abstract
    Permanent Link: http://hdl.handle.net/11104/0214718
    FileDownloadSizeCommentaryVersionAccess
    Krajicek.pdf3147.9 KBPublisher’s postprintopen-access
     
     
    5.
    0380502 - MÚ 2013 RIV NL eng J - Journal Article
    Krajíček, Jan
    A note on SAT algorithms and proof complexity.
    Information Processing Letters. Roč. 112, č. 12 (2012), s. 490-493. ISSN 0020-0190. E-ISSN 1872-6119
    R&D Projects: GA AV ČR IAA100190902
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : computational complexity
    Subject RIV: BA - General Mathematics
    Impact factor: 0.488, year: 2012
    http://www.sciencedirect.com/science/article/pii/S0020019012000774
    Permanent Link: http://hdl.handle.net/11104/0211194
    FileDownloadSizeCommentaryVersionAccess
    Krajicek1.pdf3136.5 KBPublisher’s postprintrequire
     
     
    6.
    0369662 - MÚ 2012 RIV SG eng J - Journal Article
    Krajíček, Jan
    On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function.
    Journal of Mathematical Logic. Roč. 11, č. 1 (2011), s. 11-27. ISSN 0219-0613. E-ISSN 1793-6691
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT LC505
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : proof complexity * Nisan-Wigderson generator
    Subject RIV: BA - General Mathematics
    Impact factor: 0.500, year: 2011
    http://www.worldscinet.com/jml/11/1101/S0219061311000979.html
    Permanent Link: http://hdl.handle.net/11104/0203675
    FileDownloadSizeCommentaryVersionAccess
    Krajicek1.pdf3436.2 KBPublisher’s postprintrequire
     
     
    7.
    0369652 - MÚ 2012 RIV DE eng J - Journal Article
    Krajíček, Jan
    A note on propositional proof complexity of some Ramsey-type statements.
    Archive for Mathematical Logic. Roč. 50, 1-2 (2011), s. 245-255. ISSN 0933-5846. E-ISSN 1432-0665
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT LC505
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : proof complexity * Ramsey theorem * resolution
    Subject RIV: BA - General Mathematics
    Impact factor: 0.341, year: 2011
    http://www.springerlink.com/content/q27255801x225772/
    Permanent Link: http://hdl.handle.net/11104/0203666
    FileDownloadSizeCommentaryVersionAccess
    Krajicek.pdf2188.1 KBPublisher’s postprintrequire
     
     
    8.
    0353751 - MÚ 2011 RIV US eng J - Journal Article
    Krajíček, Jan
    A form of feasible interpolation for constant depth Frege systems.
    Journal of Symbolic Logic. Roč. 75, č. 2 (2010), s. 774-784. ISSN 0022-4812. E-ISSN 1943-5886
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT LC505
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : feasible interpolation * Frege proof systems * lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.584, year: 2010
    http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9061183&fileId=S0022481200002772
    Permanent Link: http://hdl.handle.net/11104/0192907
    FileDownloadSizeCommentaryVersionAccess
    Krajicek2.pdf1134.5 KBPublisher’s postprintrequire
     
     
    9.
    0175433 - MU-W 20030187 RIV SG eng J - Journal Article
    Krajíček, Jan
    Dehn function and length of proofs.
    International Journal of Algebra and Computation. Roč. 13, č. 5 (2003), s. 527-542. ISSN 0218-1967. E-ISSN 1793-6500
    Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
    Keywords : Dehn function * proof complexity
    Subject RIV: BA - General Mathematics
    Impact factor: 0.457, year: 2003
    Permanent Link: http://hdl.handle.net/11104/0072416
    FileDownloadSizeCommentaryVersionAccess
    Krajicek.pdf1198.4 KBPublisher’s postprintrequire
     
     
    10.
    0175432 - MU-W 20030186 RIV DE eng J - Journal Article
    Krajíček, Jan
    Interpolation and approximate semantic derivations.
    Mathematical Logic Quarterly. Roč. 48, č. 4 (2002), s. 602-606. ISSN 0942-5616. E-ISSN 1521-3870
    R&D Projects: GA AV ČR IAA1019901; GA MŠMT LN00A056
    Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
    Keywords : feasible interpolation * proof complexity * approximation method
    Subject RIV: BA - General Mathematics
    Impact factor: 0.365, year: 2002
    Permanent Link: http://hdl.handle.net/11104/0072415
    FileDownloadSizeCommentaryVersionAccess
    Krajicek1.pdf1132.2 KBPublisher’s postprintrequire
     
     

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

Accept allSettingsReject all