Search results
- 1.0559512 - MÚ 2023 RIV DE eng C - Conference Paper (international conference)
Gryaznov, Svyatoslav - Pudlák, Pavel - Talebanfard, Navid
Linear branching programs and directional affine extractors.
37th Computational Complexity Conference (CCC 2022). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2022 - (Lovett, S.), s. 1-16, č. článku 4. Leibniz International Proceedings in Informatics, 234. ISBN 978-3-95977-241-9. ISSN 1868-8969.
[37th Computational Complexity Conference (CCC 2022). Philadelphia (US), 20.07.2022-23.07.2022]
R&D Projects: GA ČR(CZ) GX19-27871X; GA ČR(CZ) GA19-05497S
Institutional support: RVO:67985840
Keywords : Boolean functions * average-case lower bounds * affine dispersers * affine extractors
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.4230/LIPIcs.CCC.2022.4
Permanent Link: https://hdl.handle.net/11104/0332788File Download Size Commentary Version Access Gryaznov.pdf 2 696.6 KB Publisher’s postprint open-access - 2.0543608 - MÚ 2022 RIV US eng J - Journal Article
Jeřábek, Emil
On the complexity of the clone membership problem.
Theory of Computing Systems. Roč. 65, č. 5 (2021), s. 839-868. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR(CZ) GA19-05497S
Institutional support: RVO:67985840
Keywords : clone membership * Boolean functions * polynomial hierarchy * threshold functions
OECD category: Pure mathematics
Impact factor: 0.616, year: 2021
Method of publishing: Limited access
https://doi.org/10.1007/s00224-020-10016-7
Permanent Link: http://hdl.handle.net/11104/0320795File Download Size Commentary Version Access Jerabek.pdf 2 940.8 KB Publisher’s postprint require - 3.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 - 4.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 - 5.0432428 - ÚI 2015 RIV CZ eng C - Conference Paper (international conference)
Kůrková, Věra
Representations of Boolean Functions by Perceptron Networks.
ITAT 2014. Information Technologies - Applications and Theory. Part II. Prague: Institute of Computer Science AS CR, 2014 - (Kůrková, V.; Bajer, L.; Peška, L.; Vojtáš, R.; Holeňa, M.; Nehéz, M.), s. 68-70. ISBN 978-80-87136-19-5.
[ITAT 2014. European Conference on Information Technologies - Applications and Theory /14./. Demänovská dolina (SK), 25.09.2014-29.09.2014]
R&D Projects: GA MŠMT(CZ) LD13002
Institutional support: RVO:67985807
Keywords : perceptron networks * model complexity * Boolean functions
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0236782File Download Size Commentary Version Access 0432428.pdf 3 58 KB Publisher’s postprint open-access - 6.0411437 - UTIA-B 20050167 RIV CZ eng C - Conference Paper (international conference)
Vomlel, Jiří
Decomposition of probability tables representing Boolean functions.
[Rozklad pravděpodobnostních tabulek representujících boolovské funkce.]
Praha: Oeconomica, 2005. ISBN 80-245-0915-6. In: Proceedings of the 8th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty. - (Kroupa, T.; Vejnarová, J.), s. 159-166
[Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty /8./. Třešť (CZ), 18.09.2005-21.09.2005]
R&D Projects: GA ČR GA201/04/0393; GA MŠMT 1M0572
Institutional research plan: CEZ:AV0Z10750506
Keywords : conditional probability * Boolean functions * tensor rank-one decomposition
Subject RIV: BD - Theory of Information
Permanent Link: http://hdl.handle.net/11104/0131518 - 7.0404881 - UIVT-O 220777 DE eng C - Conference Paper (international conference)
Savický, Petr
On Random Orderings of Variables for Parity OBDDs.
Electronic Colloquium on Computational Complexity, TR98-068. Trier, 1998
R&D Projects: GA ČR GA201/98/0717; GA MŠMT OK 304
Keywords : representation of Boolean functions * OBDD * random ordering of variables
Subject RIV: BA - General Mathematics
http://www.eccc.uni-trier.de/report/1998/068
Permanent Link: http://hdl.handle.net/11104/0125107 - 8.0404244 - UIVT-O 20010071 RIV US eng J - Journal Article
Savický, Petr
On Random Orderings of Variables for Parity Ordered Binary Decision Diagrams.
Random Structures and Algorithms. Roč. 16, č. 3 (2000), s. 233-239. ISSN 1042-9832. E-ISSN 1098-2418
R&D Projects: GA ČR GA201/98/0717; GA MŠMT OK 304
Grant - others:ALTEC-KIT(XE) INCO-COOP 96-0195
Institutional research plan: AV0Z1030915
Keywords : representation of Boolean functions * OBDD * variable ordering
Subject RIV: BA - General Mathematics
Impact factor: 0.568, year: 2000
Permanent Link: http://hdl.handle.net/11104/0124508 - 9.0403891 - UIVT-O 20020141 RIV CH eng J - Journal Article
Jukna, S. - Razborov, A. - Savický, Petr - Wegener, I.
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.
Computational Complexity. Roč. 8, č. 4 (1999), s. 357-370. ISSN 1016-3328. E-ISSN 1420-8954
R&D Projects: GA ČR GA201/95/0976
Institutional research plan: AV0Z1030915
Keywords : computational complexity * Boolean functions * decision trees * branching programs * P versus NP intersection co-NP
Subject RIV: BA - General Mathematics
Impact factor: 0.161, year: 1999
Permanent Link: http://hdl.handle.net/11104/0124178 - 10.0403395 - UIVT-O 20000006 RIV NL eng J - Journal Article
Žák, Stanislav - Savický, Petr
A Read-once Lower Bound and a (1,+k) - Hierarchy for Branching Programs.
Theoretical Computer Science. Roč. 238, č. 1-2 (2000), s. 347-362. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR GA201/98/0717
Grant - others:MŠMT ČR(CZ) OK 304
Institutional research plan: AV0Z1030915
Keywords : Boolean functions * branching programs * lower bounds
Subject RIV: BA - General Mathematics
Impact factor: 0.417, year: 2000
Permanent Link: http://hdl.handle.net/11104/0123705