Search results
- 1.0422281 - MÚ 2014 RIV US eng J - Journal Article
Cavagnetto, Stefano
The lengths of proofs: Kreisel’s conjecture and Gödel’s speed-up theorem.
Journal of Mathematical Sciences. Roč. 158, č. 5 (2009), s. 689-707. ISSN 1072-3374
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : Kreisel Georg * Gödel
Subject RIV: BA - General Mathematics
http://link.springer.com/article/10.1007/s10958-009-9408-0
Permanent Link: http://hdl.handle.net/11104/0228471File Download Size Commentary Version Access Cavagnetto3.pdf 1 362 KB Publisher’s postprint require - 2.0380563 - MÚ 2013 RIV PL eng J - Journal Article
Cavagnetto, Stefano
String rewriting and proof complexity: an interpretation of resolution.
Reports on mathematical logic. Roč. 44, Jun (2009), s. 167-200. ISSN 0137-2904. E-ISSN 0137-2904
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : propositional logic * propositional proof complexity
Subject RIV: BA - General Mathematics
http://www.iphils.uj.edu.pl/rml/rml-44/a-cav-44.htm
Permanent Link: http://hdl.handle.net/11104/0211239File Download Size Commentary Version Access Cavagnetto1.pdf 0 321.4 KB Publisher’s postprint open-access - 3.0380559 - MÚ 2013 RIV DE eng J - Journal Article
Cavagnetto, Stefano
Some applications of propositional logic to cellular automata.
Mathematical Logic Quarterly. Roč. 55, č. 6 (2009), s. 605-616. ISSN 0942-5616. E-ISSN 1521-3870
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : propositional logic * propositional proof complexity * cellular
Subject RIV: BA - General Mathematics
Impact factor: 0.523, year: 2009
http://onlinelibrary.wiley.com/doi/10.1002/malq.200810008/abstract
Permanent Link: http://hdl.handle.net/11104/0211236File Download Size Commentary Version Access Cavagnetto2.pdf 1 157.7 KB Publisher’s postprint require - 4.0353280 - MÚ 2011 RIV NL eng J - Journal Article
Jeřábek, Emil
On theories of bounded arithmetic for NC1.
Annals of Pure and Applied Logic. Roč. 162, č. 4 (2011), s. 322-340. 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 * circuit complexity * propositional translation
Subject RIV: BA - General Mathematics
Impact factor: 0.450, year: 2011
http://www.sciencedirect.com/science/article/pii/S0168007210001260
Permanent Link: http://hdl.handle.net/11104/0192570File Download Size Commentary Version Access Jerabek1.pdf 1 361 KB Publisher’s postprint require - 5.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
Permanent Link: http://hdl.handle.net/11104/0192567File Download Size Commentary Version Access Jerabek.pdf 1 306.7 KB Publisher’s postprint require - 6.0343145 - MÚ 2011 RIV DE eng J - Journal Article
Jeřábek, Emil
Abelian groups and quadratic residues in weak arithmetic.
Mathematical Logic Quarterly. Roč. 56, č. 3 (2010), s. 262-278. ISSN 0942-5616. E-ISSN 1521-3870
R&D Projects: GA AV ČR IAA1019401; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : bounded arithmetic * abelian group * Fermat's little theorem * quadratic reciprocity
Subject RIV: BA - General Mathematics
Impact factor: 0.361, year: 2010
http://onlinelibrary.wiley.com/doi/10.1002/malq.200910009/abstract;jsessionid=9F636FFACB84C025FD90C7E6880350DD.f03t03
Permanent Link: http://hdl.handle.net/11104/0185687File Download Size Commentary Version Access Jerabek.pdf 1 595.5 KB Publisher’s postprint require - 7.0342826 - MÚ 2011 RIV NL eng J - Journal Article
Hrubeš, P. - Jukna, S. - Kulikov, A. - Pudlák, Pavel
On convex complexity measures.
Theoretical Computer Science. Roč. 411, 16-18 (2010), s. 1842-1854. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : boolean formula * complexity measure * combinatorial rectangle * convexity
Subject RIV: BA - General Mathematics
Impact factor: 0.838, year: 2010
http://www.sciencedirect.com/science/article/pii/S0304397510000885
Permanent Link: http://hdl.handle.net/11104/0185450File Download Size Commentary Version Access Pudlak.pdf 1 398.4 KB Publisher’s postprint require - 8.0338975 - MÚ 2010 RIV US eng J - Journal Article
Chrobak, M. - Hurand, M. - Sgall, Jiří
Algorithms for testing fault-tolerance of sequenced jobs.
Journal of Scheduling. Roč. 12, č. 5 (2009), s. 501-515. ISSN 1094-6136. E-ISSN 1099-1425
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902; GA AV ČR IAA1019401
Keywords : sequencing algorithms * fault-tolerance * dynamic programming
Subject RIV: IN - Informatics, Computer Science
Impact factor: 1.265, year: 2009
Permanent Link: http://hdl.handle.net/11104/0182616File Download Size Commentary Version Access Sgall1.pdf 1 579 KB Publisher’s postprint require - 9.0334962 - MÚ 2010 RIV SG eng J - Journal Article
Zajíček, Ondřej
A note on scheduling parallel unit jobs on hypercubes.
[O rozvrhování paralelních úloh na hyperkrychlích.]
International Journal of Foundations of Computer Science. Roč. 20, č. 2 (2009), s. 341-349. ISSN 0129-0541. E-ISSN 1793-6373
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : scheduling * deadline * dynamic programming
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.512, year: 2009
Permanent Link: http://hdl.handle.net/11104/0179566 - 10.0334960 - MÚ 2010 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Jawor, W. - Sgall, Jiří
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
[Preemptivní online rozvrhování: optimální algoritmy pro všechny rychlosti.]
Algorithmica. Roč. 53, č. 4 (2009), s. 504-522. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : anline algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.917, year: 2009
Permanent Link: http://hdl.handle.net/11104/0179564File Download Size Commentary Version Access Ebenlendr1.pdf 1 435.2 KB Publisher’s postprint require