Search results
- 1.0444427 - ÚI 2016 US eng V - Research Report
Hladký, Jan - Piguet, Diana - Komlós, J. - Simonovits, M. - Stein, M.J. - Szemerédi, E.
The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result.
Cornell University, 2016. 67 s. arXiv.org e-Print archive, arXiv:1408.3870 [math.CO].
R&D Projects: GA MŠMT(CZ) 1M0545
EU Projects: European Commission(XE) 628974 - PAECIDM
Grant - others:GA MŠK(CZ) CZ.1.05/1.1.00/02.0090
Institutional support: RVO:67985840 ; RVO:67985807
Subject RIV: BA - General Mathematics
https://arxiv.org/abs/1408.3870
Permanent Link: http://hdl.handle.net/11104/0246949 - 2.0444426 - ÚI 2016 US eng V - Research Report
Hladký, Jan - Komlós, J. - Piguet, Diana - Simonovits, M. - Stein, M.J. - Szemerédi, E.
The Approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS graphs.
Cornell University, 2016. 49 s. arXiv.org e-Print archive, arXiv:1408.3866 [math.CO].
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GJ16-07822Y
Grant - others:GA MŠK(CZ) CZ.1.05/1.1.00/02.0090
Institutional support: RVO:67985840 ; RVO:67985807
Subject RIV: BA - General Mathematics
https://arxiv.org/abs/1408.3866
Permanent Link: http://hdl.handle.net/11104/0246948 - 3.0444425 - ÚI 2016 US eng V - Research Report
Hladký, Jan - Komlós, J. - Piguet, Diana - Simonovits, M. - Stein, M.J. - Szemerédi, E.
The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs.
Cornell University, 2016. 38 s. arXiv.org e-Print archive, arXiv:1408.3871 [math.CO].
R&D Projects: GA MŠMT(CZ) 1M0545
EU Projects: European Commission(XE) 628974 - PAECIDM
Grant - others:GA MŠK(CZ) CZ.1.05/1.1.00/02.0090; EPRSC(GB) EP/J501414/1
Institutional support: RVO:67985840 ; RVO:67985807
Subject RIV: BA - General Mathematics
https://arxiv.org/abs/1408.3871
Permanent Link: http://hdl.handle.net/11104/0246950 - 4.0444424 - ÚI 2016 US eng V - Research Report
Hladký, Jan - Komlós, J. - Piguet, Diana - Simonovits, M. - Stein, M.J. - Szemerédi, E.
The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition.
Cornell University, 2015. 33 s. arXiv.org e-Print archive, arXiv:1408.3858 [math.CO].
R&D Projects: GA MŠMT(CZ) 1M0545
EU Projects: European Commission(XE) 628974 - PAECIDM
Grant - others:GA MŠK(CZ) CZ.1.05/1.1.00/02.0090; EPRSC(GB) EP/D063191/1; EPRSC(GB) EP/J501414/1
Institutional support: RVO:67985840 ; RVO:67985807
Subject RIV: BA - General Mathematics
https://arxiv.org/abs/1408.3858
Permanent Link: http://hdl.handle.net/11104/0246947 - 5.0440854 - ÚI 2015 US eng V - Research Report
Čepek, O. - Kučera, P. - Savický, Petr
Boolean Functions with a Simple Certificate for CNF Complexity..
Piscataway: Rutgers Center for Operations Research, 2010. 30 s. Technical Report, RRR 2-2010.
R&D Projects: GA MŠMT(CZ) 1M0545
Grant - others:GA ČR GP201/07/P168; GA ČR GA201/07/0205
Institutional research plan: CEZ:AV0Z10300504
Keywords : Boolean functions * CNF representations
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0243946File Download Size Commentary Version Access 02_2010.pdf 0 873 KB Other open-access - 6.0405530 - UIVT-O 330908 US eng V - Research Report
Šíma, Jiří - Schaeffer, S.E.
On the NP-Completeness of Some Graph Cluster Measures.
Cornell University, 2005. 9 s. arXiv.org e-Print archive, cs.CC/0506100.
R&D Projects: GA MŠMT 1M0545
Keywords : graph clustering * conductance * density * cluster editing * NP-completeness
Subject RIV: BA - General Mathematics
http://arxiv.org/pdf/cs.CC/0506100
Permanent Link: http://hdl.handle.net/11104/0125688 - 7.0405458 - UIVT-O 330833 SIGLE CZ eng V - Research Report
Coufal, David
Representation of Continuous Archimedean Radial Fuzzy Systems.
Prague: ICS AS CR, 2004. 14 s. Technical Report, V-924.
R&D Projects: GA MŠMT 1M0545
Keywords : radial fuzzy systems * additive generators * functional equations
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0125622File Download Size Commentary Version Access v924-04.pdf 20 284.2 KB Other open-access - 8.0331291 - ÚI 2010 CZ eng V - Research Report
Šíma, Jiří - Žák, Stanislav
A Characterization of Hitting Sets for 1-Branching Programs of Width 3 (Revised Version).
Prague: ICS AS CR, 2009. 18 s. Technical Report, V-1054.
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR 1ET100300517
Institutional research plan: CEZ:AV0Z10300504
Keywords : derandomization, hitting set * hitting set * read-once branching programs * bounded width
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0176844File Download Size Commentary Version Access v1054-09.pdf 16 253 KB Other open-access - 9.0313794 - ÚI 2009 SIGLE CZ eng V - Research Report
Šíma, Jiří - Žák, Stanislav
A Characterization of Hitting Sets for 1 Branching Programs of Width 3.
Prague: ICS AS CR, 2008. 11 s. Technical Report, V-1029.
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR 1ET100300517
Institutional research plan: CEZ:AV0Z10300504
Keywords : derandomization, hitting set * branching programs of bounded width
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0164506File Download Size Commentary Version Access v1029-08.pdf 0 207.8 KB Other require - 10.0089500 - ÚI 2008 CZ eng V - Research Report
Bílková, Marta
Feasible Disjunction Property and Feasible Interpolation in Modal Logic.
Prague: ITI Charles University, 2007. 15 s. ITI Series, 2007-341.
R&D Projects: GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10300504
Keywords : interpolation * modal logic * disjunction property * feasible interpolation
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0150695