Petr Savický

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 18

Top Topics

Boolean Functions

Top Venues

Theor. Comput. Sci.

J. Artif. Intell. Res.

Publications

Petr Savický
On CNF formulas irredundant with respect to unit clause propagation. CoRR (2023)
Petr Kucera, Petr Savický
Propagation complete encodings of smooth DNNF theories. Constraints An Int. J. 27 (3) (2022)
Petr Kucera, Petr Savický
Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings. AAAI (2021)
Petr Kucera, Petr Savický
Bounds on the Size of PC and URC Formulas. J. Artif. Intell. Res. 69 (2020)
Petr Kucera, Petr Savický
On the size of CNF formulas with high propagation strength. ISAIM (2020)
Petr Kucera, Petr Savický
Bounds on the size of PC and URC formulas. CoRR (2020)
Petr Kucera, Petr Savický, Vojtech Vorel
A lower bound on CNF encodings of the at-most-one constraint. Theor. Comput. Sci. 762 (2019)
Petr Kucera, Petr Savický
Propagation complete encodings of smooth DNNF theories. CoRR (2019)
Petr Kucera, Petr Savický
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings. CoRR (2018)
Jirí Síma, Petr Savický
-expansions and cut languages. Theor. Comput. Sci. 720 (2018)
Petr Kucera, Petr Savický, Vojtech Vorel
A lower bound on CNF encodings of the at-most-one constraint. CoRR (2017)
Petr Savický, Petr Kucera
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract). IJCAI (2017)
Petr Kucera, Petr Savický, Vojtech Vorel
A Lower Bound on CNF Encodings of the At-Most-One Constraint. SAT (2017)
Jirí Síma, Petr Savický
Cut Languages in Rational Bases. LATA (2017)
Petr Savický, Petr Kucera
Generating Models of a Matched Formula With a Polynomial Delay. J. Artif. Intell. Res. 56 (2016)
Petr Savický, Petr Kucera
Generating models of a matched formula with a polynomial delay. ISAIM (2016)
Zuzana Haniková, Petr Savický
-algebras. Theor. Comput. Sci. 631 (2016)
Zuzana Haniková, Petr Savický
Term satisfiability in FL$_\mathrm{ew}$-algebras. CoRR (2015)
Petr Savický
Boolean functions with a vertex-transitive group of automorphisms. Electron. Colloquium Comput. Complex. 20 (2013)
Ondrej Cepek, Petr Kucera, Petr Savický
Boolean functions with a simple certificate for CNF complexity. Discret. Appl. Math. 160 (4-5) (2012)
Petr Savický, Jirí Vomlel
Triangulation Heuristics for BN2O Networks. ECSQARU (2009)
Zuzana Haniková, Petr Savický
Distinguishing standard SBL-algebras with involutive negations by propositional formulas. Math. Log. Q. 54 (6) (2008)
Petr Savický, Marko Robnik-Sikonja
Learning Random Numbers: a MATLAB Anomaly. Appl. Artif. Intell. 22 (3) (2008)
Jakub Dvorák, Petr Savický
Softening Splits in Decision Trees Using Simulated Annealing. ICANNGA (1) (2007)
Petr Savický, Jirí Vomlel
Exploiting tensor rank-one decomposition in probabilistic inference. Kybernetika 43 (5) (2007)
Petr Savický, Roberto Cignoli, Francesc Esteva, Lluís Godo, Carles Noguera
On Product Logic with Truth-constants. J. Log. Comput. 16 (2) (2006)
Petr Savický, Detlef Sieling
A hierarchy result for read-once branching programs with restricted parity nondeterminism. Theor. Comput. Sci. 340 (3) (2005)
Matthias Krause, Petr Savický, Ingo Wegener
On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. 201 (2) (2005)
Petr Savický, Johannes Fürnkranz
Combining Pairwise Classifiers with Stacking. IDA (2003)
Petr Savický, Jaroslava Hlavácová
Measures of Word Commonness. J. Quant. Linguistics 9 (3) (2002)
Petr Savický, Jan Klaschka
Optimally Trained Regression Trees and Occam's Razor. COMPSTAT (2002)
Petr Savický
On determinism versus unambiquous nondeterminism for decision trees Electron. Colloquium Comput. Complex. (009) (2002)
Petr Savický, Detlef Sieling
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism Electron. Colloquium Comput. Complex. 8 (17) (2001)
Petr Savický
On random orderings of variables for parity ordered binary decision diagrams. Random Struct. Algorithms 16 (3) (2000)
Petr Savický, Stanislav Zák
A read-once lower bound and a (1, +k)-hierarchy for branching programs. Theor. Comput. Sci. 238 (1-2) (2000)
Petr Savický, Detlef Sieling
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. MFCS (2000)
Petr Savický, Jirí Sgall
DNF tautologies with a limited number of occurrences of every variable. Theor. Comput. Sci. 238 (1-2) (2000)
Matthias Krause, Petr Savický, Ingo Wegener
Approximations by OBDDs and the variable ordering problem Electron. Colloquium Comput. Complex. 6 (11) (1999)
Matthias Krause, Petr Savický, Ingo Wegener
Approximations by OBDDs and the Variable Ordering Problem. ICALP (1999)
Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
On P versus NP cap co-NP for decision trees and read-once branching programs. Comput. Complex. 8 (4) (1999)
Petr Savický, Alan R. Woods
The number of Boolean functions computed by formulas of a given size. Random Struct. Algorithms 13 (3-4) (1998)
Petr Savický
A probabilistic nonequivalence test for syntactic (1,+k)-branching programs Electron. Colloquium Comput. Complex. 5 (51) (1998)
Petr Savický
Complexity and Probability of Some Boolean Formulas. Comb. Probab. Comput. 7 (4) (1998)
Petr Savický
On Random Orderings of Variables for Parity OBDDs Electron. Colloquium Comput. Complex. 5 (68) (1998)
Vera Kurková, Petr Savický, Katerina Hlavácková
Representations and rates of approximation of real-valued Boolean functions by neural networks. Neural Networks 11 (4) (1998)
Petr Savický
Complexity and Probability of some Boolean Formulas Electron. Colloquium Comput. Complex. 4 (57) (1997)
Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs Electron. Colloquium Comput. Complex. 4 (23) (1997)
Petr Savický, Ingo Wegener
Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. Acta Informatica 34 (4) (1997)
Katerina Hlavácková, Vera Kurková, Petr Savický
Upper Bounds on the Approximation Rates of Real-valued Boolean Functions by Neural Networks. ICANNGA (1997)
Hanno Lefmann, Petr Savický
Some typical properties of large AND/OR Boolean formulas. Random Struct. Algorithms 10 (3) (1997)
Petr Savický, Stanislav Zák
A Hierarchy for (1, +k)-Branching Programs with Respect of k. MFCS (1997)
Petr Savický, Stanislav Zák
A Lower Bound on Branching Programs Reading Some Bits Twice. Theor. Comput. Sci. 172 (1-2) (1997)
Hanno Lefmann, Pavel Pudlák, Petr Savický
On Sparse Parity Check Matrices. Des. Codes Cryptogr. 12 (2) (1997)
Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. MFCS (1997)
Petr Savický, Stanislav Zák
A large lower bound for 1-branching programs Electron. Colloquium Comput. Complex. 3 (36) (1996)
Petr Savický, Stanislav Zák
A hierarchy for (1,+k)-branching programs with respect to k Electron. Colloquium Comput. Complex. 3 (50) (1996)
Hanno Lefmann, Pavel Pudlák, Petr Savický
On Sparse Parity Chack Matrices (Extended Abstract). COCOON (1996)
Petr Savický
Bent functions and random boolean formulas. Discret. Math. 147 (1-3) (1995)
Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický
On the Average Case Circuit Delay of Disjunction. Parallel Process. Lett. 5 (1995)
Petr Savický
Improved Boolean Formulas for the Ramsey Graphs. Random Struct. Algorithms 6 (4) (1995)
Hanno Lefmann, Petr Savický
Some Typical Properties of Large AND/OR Boolean Formulas. MFCS (1995)
Petr Savický, Ingo Wegener
Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams. FSTTCS (1994)
Petr Savický
On the Bent Boolean Functions That are Symmetric. Eur. J. Comb. 15 (4) (1994)
Pavel Pudlák, Petr Savický
On shifting networks. Theor. Comput. Sci. 116 (2) (1993)
Jan Kratochvíl, Petr Savický, Zsolt Tuza
One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. SIAM J. Comput. 22 (1) (1993)
Petr Savický
Random boolean formulas representing any boolean function with asymptotically equal probability. Discret. Math. 83 (1) (1990)
Petr Savický
Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract). MFCS (1988)
Pavel Pudlák, Vojtech Rödl, Petr Savický
Graph Complexity. Acta Informatica 25 (5) (1988)