Search results

  1. 1.
    0545429 - ÚI 2022 US eng V - Research Report
    Kučera, P. - Savický, Petr - Vorel, V.
    A lower bound on CNF encodings of the at-most-one constraint.
    Cornell University, 2017. 38 s. arXiv.org e-Print archive, arXiv:1704.08934 [cs.CC].
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985807
    https://arxiv.org/abs/1704.08934
    Permanent Link: http://hdl.handle.net/11104/0322116
     
     
  2. 2.
    0545428 - ÚI 2022 US eng V - Research Report
    Kučera, P. - Savický, Petr
    Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings.
    Cornell University, 2018. 21 s. arXiv.org e-Print archive, arXiv:1811.09435 [cs.AI].
    R&D Projects: GA ČR(CZ) GA19-19463S
    Institutional support: RVO:67985807
    https://arxiv.org/abs/1811.09435
    Permanent Link: http://hdl.handle.net/11104/0322115
     
     
  3. 3.
    0545427 - ÚI 2022 US eng V - Research Report
    Kučera, P. - Savický, Petr
    Propagation complete encodings of smooth DNNF theories.
    Cornell University, 2019. 38 s. arXiv.org e-Print archive, arXiv:1909.06673 [cs.AI].
    R&D Projects: GA ČR(CZ) GA19-19463S
    Institutional support: RVO:67985807
    https://arxiv.org/abs/1909.06673
    Permanent Link: http://hdl.handle.net/11104/0322114
     
     
  4. 4.
    0545426 - ÚI 2022 US eng V - Research Report
    Kučera, P. - Savický, Petr
    Bounds on the size of PC and URC formulas.
    Cornell University, 2020. 24 s. arXiv.org e-Print archive, arXiv:2001.00819 [cs.LO].
    R&D Projects: GA ČR(CZ) GA19-19463S
    Institutional support: RVO:67985807
    https://arxiv.org/abs/2001.00819
    Permanent Link: http://hdl.handle.net/11104/0322113
     
     
  5. 5.
    0545425 - ÚI 2022 US eng V - Research Report
    Savický, Petr
    Examples of distance magic labelings of the 6-dimensional hypercube.
    Cornell University, 2021. 3 s. arXiv.org e-Print archive, arXiv:2102.08212 [math.GM].
    Institutional support: RVO:67985807
    https://arxiv.org/abs/2102.08212
    Permanent Link: http://hdl.handle.net/11104/0322112
     
     
  6. 6.
    0504990 - ÚI 2020 DE eng V - Research Report
    Savický, Petr
    On determinism versus unambiquous nondeterminism for decision trees.
    Trier, 2002. Electronic Colloquium on Computational Complexity, TR02-009. ISSN 1433-8092
    R&D Projects: GA MŠMT LN00A056
    https://eccc.weizmann.ac.il//report/2002/009/
    Permanent Link: http://hdl.handle.net/11104/0296520
     
     
  7. 7.
    0465640 - ÚI 2017 CZ eng V - Research Report
    Šíma, Jiří - Savický, Petr
    Cut Languages in Rational Bases.
    Prague: ICS CAS, 2016. 12 s. Technical Report, V-1236.
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985807
    Keywords : cut language * rational base * quassi-periodic power series
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0264101
    FileDownloadSizeCommentaryVersionAccess
    v1236-16.pdf15283 KBOtheropen-access
     
     
  8. 8.
    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/0243946
    FileDownloadSizeCommentaryVersionAccess
    02_2010.pdf0873 KBOtheropen-access
     
     
  9. 9.
    0439176 - ÚI 2015 US eng V - Research Report
    Haniková, Zuzana - Savický, Petr
    Term satisfiability in FLew-algebras.
    Cornell University, 2015. 24 s. arXiv.org e-Print archive, arXiv:1501.02250 [cs.LO].
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985807
    Keywords : substructural logic * FLew-algebra * MV-algebra * satisfiability * computational complexity
    Subject RIV: BA - General Mathematics
    http://arxiv.org/abs/1501.02250
    Permanent Link: http://hdl.handle.net/11104/0242467
     
     
  10. 10.
    0433894 - ÚI 2015 DE eng V - Research Report
    Savický, Petr
    Boolean functions with a vertex-transitive group of automorphisms.
    Trier, 2013. 24 s. Electronic Colloquium on Computational Complexity, TR13-191. ISSN 1433-8092
    R&D Projects: GA ČR GAP202/10/1333
    Institutional support: RVO:67985807
    Keywords : Boolean Functions * hypercube * isometric transformation * vertex-transitive group of automorphisms
    Subject RIV: BA - General Mathematics
    http://eccc.hpi-web.de/report/2013/191/
    Permanent Link: http://hdl.handle.net/11104/0238058
     
     

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