Petr Savický

According to our database, Petr Savický authored at least 57 papers between 1988 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

On CNF formulas irredundant with respect to unit clause propagation.

Petr Savický

CoRR, 2023

2022

Propagation complete encodings of smooth DNNF theories.

Petr Kucera, Petr Savický

Constraints An Int. J., 2022

2021

Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings.

Petr Kucera, Petr Savický

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Bounds on the Size of PC and URC Formulas.

Petr Kucera, Petr Savický

J. Artif. Intell. Res., 2020

On the size of CNF formulas with high propagation strength.

Petr Kucera, Petr Savický

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

2019

A lower bound on CNF encodings of the at-most-one constraint.

Petr Kucera, Petr Savický, Vojtech Vorel

Theor. Comput. Sci., 2019

2018

Quasi-periodic <i>β</i>-expansions and cut languages.

Jirí Síma, Petr Savický

Theor. Comput. Sci., 2018

Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings.

Petr Kucera, Petr Savický

CoRR, 2018

2017

Cut Languages in Rational Bases.

Jirí Síma, Petr Savický

Proceedings of the Language and Automata Theory and Applications, 2017

Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract).

Petr Savický, Petr Kucera

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Term satisfiability in FL_ew-algebras.

Zuzana Haniková, Petr Savický

Theor. Comput. Sci., 2016

Generating Models of a Matched Formula With a Polynomial Delay.

Petr Savický, Petr Kucera

J. Artif. Intell. Res., 2016

2015

Term satisfiability in FL$_\mathrm{ew}$-algebras.

Zuzana Haniková, Petr Savický

CoRR, 2015

2013

Boolean functions with a vertex-transitive group of automorphisms.

Petr Savický

Electron. Colloquium Comput. Complex., 2013

2012

Boolean functions with a simple certificate for CNF complexity.

Ondrej Cepek, Petr Kucera, Petr Savický

Discret. Appl. Math., 2012

2009

Triangulation Heuristics for BN2O Networks.

Petr Savický, Jirí Vomlel

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2009

2008

Distinguishing standard SBL-algebras with involutive negations by propositional formulas.

Zuzana Haniková, Petr Savický

Math. Log. Q., 2008

Learning Random Numbers: a MATLAB Anomaly.

Petr Savický, Marko Robnik-Sikonja

Appl. Artif. Intell., 2008

2007

Exploiting tensor rank-one decomposition in probabilistic inference.

Petr Savický, Jirí Vomlel

Kybernetika, 2007

Softening Splits in Decision Trees Using Simulated Annealing.

Jakub Dvorák, Petr Savický

Proceedings of the Adaptive and Natural Computing Algorithms, 8th International Conference, 2007

2006

On Product Logic with Truth-constants.

Petr Savický, Roberto Cignoli, Francesc Esteva, Lluís Godo, Carles Noguera

J. Log. Comput., 2006

2005

A hierarchy result for read-once branching programs with restricted parity nondeterminism.

Petr Savický, Detlef Sieling

Theor. Comput. Sci., 2005

On the influence of the variable ordering for algorithmic learning using OBDDs.

Matthias Krause, Petr Savický, Ingo Wegener

Inf. Comput., 2005

2003

Combining Pairwise Classifiers with Stacking.

Petr Savický, Johannes Fürnkranz

Proceedings of the Advances in Intelligent Data Analysis V, 2003

2002

Measures of Word Commonness.

Petr Savický, Jaroslava Hlavácová

J. Quant. Linguistics, 2002

On determinism versus unambiquous nondeterminism for decision trees

Petr Savický

Electron. Colloquium Comput. Complex., 2002

Optimally Trained Regression Trees and Occam's Razor.

Petr Savický, Jan Klaschka

Proceedings of the COMPSTAT 2002, 2002

2000

A read-once lower bound and a (1, +k)-hierarchy for branching programs.

Petr Savický, Stanislav Zák

Theor. Comput. Sci., 2000

DNF tautologies with a limited number of occurrences of every variable.

Petr Savický, Jirí Sgall

Theor. Comput. Sci., 2000

On random orderings of variables for parity ordered binary decision diagrams.

Petr Savický

Random Struct. Algorithms, 2000

1999

Approximations by OBDDs and the variable ordering problem

Matthias Krause, Petr Savický, Ingo Wegener

Electron. Colloquium Comput. Complex., 1999

On P versus NP cap co-NP for decision trees and read-once branching programs.

Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener

Comput. Complex., 1999

1998

The number of Boolean functions computed by formulas of a given size.

Petr Savický, Alan R. Woods

Random Struct. Algorithms, 1998

Representations and rates of approximation of real-valued Boolean functions by neural networks.

Vera Kurková, Petr Savický, Katerina Hlavácková

Neural Networks, 1998

On Random Orderings of Variables for Parity OBDDs

Petr Savický

Electron. Colloquium Comput. Complex., 1998

A probabilistic nonequivalence test for syntactic (1,+k)-branching programs

Petr Savický

Electron. Colloquium Comput. Complex., 1998

1997

A Lower Bound on Branching Programs Reading Some Bits Twice.

Petr Savický, Stanislav Zák

Theor. Comput. Sci., 1997

Some typical properties of large AND/OR Boolean formulas.

Hanno Lefmann, Petr Savický

Random Struct. Algorithms, 1997

Complexity and Probability of some Boolean Formulas

Petr Savický

Electron. Colloquium Comput. Complex., 1997

On Sparse Parity Check Matrices.

Hanno Lefmann, Pavel Pudlák, Petr Savický

Des. Codes Cryptogr., 1997

Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams.

Petr Savický, Ingo Wegener

Acta Informatica, 1997

A Hierarchy for (1, +k)-Branching Programs with Respect of k.

Petr Savický, Stanislav Zák

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.

Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Upper Bounds on the Approximation Rates of Real-valued Boolean Functions by Neural Networks.

Katerina Hlavácková, Vera Kurková, Petr Savický

Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997

1996

A hierarchy for (1,+k)-branching programs with respect to k

Petr Savický, Stanislav Zák

Electron. Colloquium Comput. Complex., 1996

A large lower bound for 1-branching programs

Petr Savický, Stanislav Zák

Electron. Colloquium Comput. Complex., 1996

On Sparse Parity Chack Matrices (Extended Abstract).

Hanno Lefmann, Pavel Pudlák, Petr Savický

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Improved Boolean Formulas for the Ramsey Graphs.

Petr Savický

Random Struct. Algorithms, 1995

On the Average Case Circuit Delay of Disjunction.

Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický

Parallel Process. Lett., 1995

Bent functions and random boolean formulas.

Petr Savický

Discret. Math., 1995

1994

On the Bent Boolean Functions That are Symmetric.

Petr Savický

Eur. J. Comb., 1994

Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams.

Petr Savický, Ingo Wegener

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

On shifting networks.

Pavel Pudlák, Petr Savický

Theor. Comput. Sci., 1993

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.

Jan Kratochvíl, Petr Savický, Zsolt Tuza

SIAM J. Comput., 1993

1990

Random boolean formulas representing any boolean function with asymptotically equal probability.

Petr Savický

Discret. Math., 1990

1988

Graph Complexity.

Pavel Pudlák, Vojtech Rödl, Petr Savický

Acta Informatica, 1988

Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract).

Petr Savický

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988