# Petr Savický

According to our database1, Petr Savický
• authored at least 57 papers between 1988 and 2018.
• has a "Dijkstra number"2 of four.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2018
Quasi-periodic β-expansions and cut languages.
Theor. Comput. Sci., 2018

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

A Lower Bound on CNF Encodings of the At-Most-One Constraint.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

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

2016
Term satisfiability in FLew-algebras.
Theor. Comput. Sci., 2016

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

Generating models of a matched formula with a polynomial delay.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

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

2013
Boolean functions with a vertex-transitive group of automorphisms.
Electronic Colloquium on Computational Complexity (ECCC), 2013

2012
Boolean functions with a simple certificate for CNF complexity.
Discrete Applied Mathematics, 2012

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

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

Learning Random Numbers: a MATLAB Anomaly.
Applied Artificial Intelligence, 2008

2007
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

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

2005
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

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

2002
Measures of Word Commonness.
Journal of Quantitative Linguistics, 2002

On determinism versus unambiquous nondeterminism for decision trees
Electronic Colloquium on Computational Complexity (ECCC), 2002

2001
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
Electronic Colloquium on Computational Complexity (ECCC), 2001

2000
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

A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
Approximations by OBDDs and the variable ordering problem
Electronic Colloquium on Computational Complexity (ECCC), 1999

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

Approximations by OBDDs and the Variable Ordering Problem.
Proceedings of the Automata, 1999

1998
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
Electronic Colloquium on Computational Complexity (ECCC), 1998

A probabilistic nonequivalence test for syntactic (1,+k)-branching programs
Electronic Colloquium on Computational Complexity (ECCC), 1998

Complexity and Probability of Some Boolean Formulas.
Combinatorics, Probability & Computing, 1998

1997
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

Complexity and Probability of some Boolean Formulas
Electronic Colloquium on Computational Complexity (ECCC), 1997

On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs
Electronic Colloquium on Computational Complexity (ECCC), 1997

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

Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams.
Acta Inf., 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

1996
A hierarchy for (1,+k)-branching programs with respect to k
Electronic Colloquium on Computational Complexity (ECCC), 1996

A large lower bound for 1-branching programs
Electronic Colloquium on Computational Complexity (ECCC), 1996

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

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

On the Average Case Circuit Delay of Disjunction.
Parallel Processing Letters, 1995

Bent functions and random boolean formulas.
Discrete Mathematics, 1995

Some Typical Properties of Large AND/OR Boolean Formulas.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
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

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

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

1990
Random boolean formulas representing any boolean function with asymptotically equal probability.
Discrete Mathematics, 1990

1988
Graph Complexity.
Acta Inf., 1988

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