Petr Savický - RankMe

69 papers A* 3A 1B 6C 2Misc 3Journal 50Unranked 4

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