Petr Savický

Orcid: 0000-0001-6974-0718

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




On CNF formulas irredundant with respect to unit clause propagation.
CoRR, 2023

Propagation complete encodings of smooth DNNF theories.
Constraints An Int. J., 2022

Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Bounds on the Size of PC and URC Formulas.
J. Artif. Intell. Res., 2020

On the size of CNF formulas with high propagation strength.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

A lower bound on CNF encodings of the at-most-one constraint.
Theor. Comput. Sci., 2019

Quasi-periodic <i>β</i>-expansions and cut languages.
Theor. Comput. Sci., 2018

Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings.
CoRR, 2018

Cut Languages in Rational Bases.
Proceedings of the Language and Automata Theory and Applications, 2017

Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Term satisfiability in FL<sub>ew</sub>-algebras.
Theor. Comput. Sci., 2016

Generating Models of a Matched Formula With a Polynomial Delay.
J. Artif. Intell. Res., 2016

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

Boolean functions with a vertex-transitive group of automorphisms.
Electron. Colloquium Comput. Complex., 2013

Boolean functions with a simple certificate for CNF complexity.
Discret. Appl. Math., 2012

Triangulation Heuristics for BN2O Networks.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2009

Distinguishing standard SBL-algebras with involutive negations by propositional formulas.
Math. Log. Q., 2008

Learning Random Numbers: a MATLAB Anomaly.
Appl. Artif. Intell., 2008

Exploiting tensor rank-one decomposition in probabilistic inference.
Kybernetika, 2007

Softening Splits in Decision Trees Using Simulated Annealing.
Proceedings of the Adaptive and Natural Computing Algorithms, 8th International Conference, 2007

On Product Logic with Truth-constants.
J. Log. Comput., 2006

A hierarchy result for read-once branching programs with restricted parity nondeterminism.
Theor. Comput. Sci., 2005

On the influence of the variable ordering for algorithmic learning using OBDDs.
Inf. Comput., 2005

Combining Pairwise Classifiers with Stacking.
Proceedings of the Advances in Intelligent Data Analysis V, 2003

Measures of Word Commonness.
J. Quant. Linguistics, 2002

On determinism versus unambiquous nondeterminism for decision trees
Electron. Colloquium Comput. Complex., 2002

Optimally Trained Regression Trees and Occam's Razor.
Proceedings of the COMPSTAT 2002, 2002

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

DNF tautologies with a limited number of occurrences of every variable.
Theor. Comput. Sci., 2000

On random orderings of variables for parity ordered binary decision diagrams.
Random Struct. Algorithms, 2000

Approximations by OBDDs and the variable ordering problem
Electron. Colloquium Comput. Complex., 1999

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

The number of Boolean functions computed by formulas of a given size.
Random Struct. Algorithms, 1998

Representations and rates of approximation of real-valued Boolean functions by neural networks.
Neural Networks, 1998

On Random Orderings of Variables for Parity OBDDs
Electron. Colloquium Comput. Complex., 1998

A probabilistic nonequivalence test for syntactic (1,+k)-branching programs
Electron. Colloquium Comput. Complex., 1998

Complexity and Probability of Some Boolean Formulas.
Comb. Probab. Comput., 1998

A Lower Bound on Branching Programs Reading Some Bits Twice.
Theor. Comput. Sci., 1997

Some typical properties of large AND/OR Boolean formulas.
Random Struct. Algorithms, 1997

On Sparse Parity Check Matrices.
Des. Codes Cryptogr., 1997

Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams.
Acta Informatica, 1997

A Hierarchy for (1, +k)-Branching Programs with Respect of 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.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Upper Bounds on the Approximation Rates of Real-valued Boolean Functions by Neural Networks.
Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997

A hierarchy for (1,+k)-branching programs with respect to k
Electron. Colloquium Comput. Complex., 1996

A large lower bound for 1-branching programs
Electron. Colloquium Comput. Complex., 1996

On Sparse Parity Chack Matrices (Extended Abstract).
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

Improved Boolean Formulas for the Ramsey Graphs.
Random Struct. Algorithms, 1995

On the Average Case Circuit Delay of Disjunction.
Parallel Process. Lett., 1995

Bent functions and random boolean formulas.
Discret. Math., 1995

On the Bent Boolean Functions That are Symmetric.
Eur. J. Comb., 1994

Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

On shifting networks.
Theor. Comput. Sci., 1993

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.
SIAM J. Comput., 1993

Random boolean formulas representing any boolean function with asymptotically equal probability.
Discret. Math., 1990

Graph Complexity.
Acta Informatica, 1988

Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988