Search results
- 1.0510920 - ÚI 2020 eng V - Research Report
Žák, Stanislav
A Logical Characteristic of Read-Once Branching Programs.
Trier, 2019. 16 s. Electronic Colloquium on Computational Complexity, TR19-150. ISSN 1433-8092
Institutional support: RVO:67985807
Keywords : branching programs * Computational Complexity * logic
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://eccc.weizmann.ac.il/report/2019/150/
Permanent Link: http://hdl.handle.net/11104/0301281File Download Size Commentary Version Access 0510920-aonl.pdf 3 262.2 KB volně online Publisher’s postprint open-access - 2.0506562 - ÚI 2020 CZ eng V - Research Report
Žák, Stanislav
A Logical Characteristic of Read-Once Branching Programs.
Prague: ICS CAS, 2019. 16 s. Technical Report, V-1270.
Institutional support: RVO:67985807
Keywords : branching programs * computational complexity * logic
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0297795File Download Size Commentary Version Access 0506562-av1.pdf 0 157.8 KB verze 07/2019 Other open-access - 3.0443323 - ÚI 2016 DE eng V - Research Report
Žák, Stanislav
Inherent Logic and Complexity.
Trier, 2015. 12 s. Electronic Colloquium on Computational Complexity, TR15-029. ISSN 1433-8092
R&D Projects: GA ČR GAP202/10/1333
Institutional support: RVO:67985807
Keywords : branching programs * complexity * logic
Subject RIV: IN - Informatics, Computer Science
http://eccc.hpi-web.de/report/2015/029/
Permanent Link: http://hdl.handle.net/11104/0246047 - 4.0428781 - ÚI 2015 CZ eng V - Research Report
Žák, Stanislav
Inherent Logic and Complexity.
Prague: ICS AS CR, 2014. 17 s. Technical Report, V-1208.
R&D Projects: GA ČR GAP202/10/1333
Institutional support: RVO:67985807
Keywords : branching programs * complexity * logic
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0234049File Download Size Commentary Version Access v1208-14.pdf 25 119.9 KB Other open-access - 5.0405528 - UIVT-O 330906 RIV NL eng J - Journal Article
Savický, Petr - Sieling, D.
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.
[Výsledek o hierarchii pro read-once rozhodovací diagramy s omezeným nedeterminismem paritního typu.]
Theoretical Computer Science. Roč. 340, č. 3 (2005), s. 594-605. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA MŠMT LN00A056
Institutional research plan: CEZ:AV0Z10300504
Keywords : read-once branching programs * restricted parity nondeterminism * lower bounds on complexity * hierarchy
Subject RIV: BA - General Mathematics
Impact factor: 0.743, year: 2005
Permanent Link: http://hdl.handle.net/11104/0125686 - 6.0404725 - UIVT-O 20020127 DE eng A - Abstract
Žák, Stanislav
Information Flow in Read-Once Branching Programs.
Complexity of Boolean Functions. Dagstuhl, 2002 - (Barrington, D.; Hastad, J.; Krause, M.; Reischuk, R.). s. 11
[Seminar. 17.03.2002-22.03.2002, Dagstuhl]
Institutional research plan: AV0Z1030915
Keywords : read-once branching programs * lower bound * information flow
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0124963 - 7.0404260 - UIVT-O 20010201 RIV DE eng C - Conference Paper (international conference)
Jukna, S. - Žák, Stanislav
On Uncertainty versus Size in Branching Programs.
Electronic Colloquium on Computational Complexity. Report No.39. Trier, 2001, s. -. ISSN 1433-8092
R&D Projects: GA ČR GA201/98/0717; GA MŠMT LN00A056
Keywords : computational complexity * branching programs * decision trees * lower bounds * Kraft inequality
Subject RIV: BA - General Mathematics
http://www.eccc.uni-trier.de/report/2001/039
Permanent Link: http://hdl.handle.net/11104/0124523 - 8.0404104 - UIVT-O 20020142 RIV NL eng J - Journal Article
Jukna, S. - Žák, Stanislav
On Uncertainty versus Size in Branching Programs.
Theoretical Computer Science. Roč. 290, - (2003), s. 1851-1867. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR GA201/98/0717; GA MŠMT LN00A056; GA ČR GA201/02/1456
Keywords : computational complexity * branching programs * decision trees * lower bounds * kraft inequality * entropy
Subject RIV: BA - General Mathematics
Impact factor: 0.764, year: 2003
Permanent Link: http://hdl.handle.net/11104/0124375 - 9.0403962 - UIVT-O 20000105 CZ eng V - Research Report
Žák, Stanislav
A Subexponential Lower Bound on Read-once Branching Programs by a New Argument.
Prague: ICS AS CR, 2000. 10 s. Technical Report, V-813.
R&D Projects: GA ČR GA201/98/0717
Institutional research plan: AV0Z1030915
Keywords : read-once branching programs * lower bound
Permanent Link: http://hdl.handle.net/11104/0124246File Download Size Commentary Version Access v813-00.pdf 19 135.3 KB Other open-access - 10.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