| 2008 |
|---|
| 43 | EE | Petr Savický,
Marko Robnik-Sikonja:
Learning Random Numbers: a MATLAB Anomaly.
Applied Artificial Intelligence 22(3): 254-265 (2008) |
| 42 | EE | Zuzana Haniková,
Petr Savický:
Distinguishing standard SBL-algebras with involutive negations by propositional formulas.
Math. Log. Q. 54(6): 579-596 (2008) |
| 2007 |
|---|
| 41 | EE | Jakub Dvorák,
Petr Savický:
Softening Splits in Decision Trees Using Simulated Annealing.
ICANNGA (1) 2007: 721-729 |
| 2006 |
|---|
| 40 | EE | Petr Savický,
Roberto Cignoli,
Francesc Esteva,
Lluis Godo,
Carles Noguera:
On Product Logic with Truth-constants.
J. Log. Comput. 16(2): 205-225 (2006) |
| 2005 |
|---|
| 39 | EE | Matthias Krause,
Petr Savický,
Ingo Wegener:
On the influence of the variable ordering for algorithmic learning using OBDDs.
Inf. Comput. 201(2): 160-177 (2005) |
| 38 | EE | Petr Savický,
Detlef Sieling:
A hierarchy result for read-once branching programs with restricted parity nondeterminism.
Theor. Comput. Sci. 340(3): 594-605 (2005) |
| 2003 |
|---|
| 37 | EE | Petr Savický,
Johannes Fürnkranz:
Combining Pairwise Classifiers with Stacking.
IDA 2003: 219-229 |
| 2002 |
|---|
| 36 | EE | Petr Savický:
On determinism versus unambiquous nondeterminism for decision trees
Electronic Colloquium on Computational Complexity (ECCC)(009): (2002) |
| 35 | EE | Petr Savický,
Jaroslava Hlavácová:
Measures of Word Commonness.
Journal of Quantitative Linguistics 9(3): 215-231 (2002) |
| 2001 |
|---|
| 34 | EE | Petr Savický,
Detlef Sieling:
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
Electronic Colloquium on Computational Complexity (ECCC) 8(17): (2001) |
| 2000 |
|---|
| 33 | EE | Petr Savický,
Detlef Sieling:
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.
MFCS 2000: 650-659 |
| 32 | | Petr Savický:
On random orderings of variables for parity ordered binary decision diagrams.
Random Struct. Algorithms 16(3): 233-239 (2000) |
| 31 | EE | Petr Savický,
Stanislav Zák:
A read-once lower bound and a (1, +k)-hierarchy for branching programs.
Theor. Comput. Sci. 238(1-2): 347-362 (2000) |
| 30 | EE | Petr Savický,
Jiri Sgall:
DNF tautologies with a limited number of occurrences of every variable.
Theor. Comput. Sci. 238(1-2): 495-498 (2000) |
| 1999 |
|---|
| 29 | EE | Matthias Krause,
Petr Savický,
Ingo Wegener:
Approximations by OBDDs and the Variable Ordering Problem.
ICALP 1999: 493-502 |
| 28 | EE | Stasys Jukna,
Alexander A. Razborov,
Petr Savický,
Ingo Wegener:
On P versus NP cap co-NP for decision trees and read-once branching programs.
Computational Complexity 8(4): 357-370 (1999) |
| 27 | EE | Matthias Krause,
Petr Savický,
Ingo Wegener:
Approximations by OBDDs and the variable ordering problem
Electronic Colloquium on Computational Complexity (ECCC) 6(11): (1999) |
| 1998 |
|---|
| 26 | | Petr Savický:
Complexity and Probability of Some Boolean Formulas.
Combinatorics, Probability & Computing 7(4): 451-463 (1998) |
| 25 | EE | Petr Savický:
A probabilistic nonequivalence test for syntactic (1,+k)-branching programs
Electronic Colloquium on Computational Complexity (ECCC) 5(51): (1998) |
| 24 | EE | Petr Savický:
On Random Orderings of Variables for Parity OBDDs
Electronic Colloquium on Computational Complexity (ECCC) 5(68): (1998) |
| 23 | EE | Vera Kurková,
Petr Savický,
Katerina Hlavácková-Schindler:
Representations and rates of approximation of real-valued Boolean functions by neural networks.
Neural Networks 11(4): 651-659 (1998) |
| 22 | | Petr Savický,
Alan R. Woods:
The number of Boolean functions computed by formulas of a given size.
Random Struct. Algorithms 13(3-4): 349-382 (1998) |
| 1997 |
|---|
| 21 | | 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: 319-326 |
| 20 | | Petr Savický,
Stanislav Zák:
A Hierarchy for (1, +k)-Branching Programs with Respect of k.
MFCS 1997: 478-487 |
| 19 | | Petr Savický,
Ingo Wegener:
Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams.
Acta Inf. 34(4): 245-256 (1997) |
| 18 | | Hanno Lefmann,
Pavel Pudlák,
Petr Savický:
On Sparse Parity Check Matrices.
Des. Codes Cryptography 12(2): 107-130 (1997) |
| 17 | EE | Stasys Jukna,
Alexander A. Razborov,
Petr Savický,
Ingo Wegener:
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 4(23): (1997) |
| 16 | EE | Petr Savický:
Complexity and Probability of some Boolean Formulas
Electronic Colloquium on Computational Complexity (ECCC) 4(57): (1997) |
| 15 | | Hanno Lefmann,
Petr Savický:
Some typical properties of large AND/OR Boolean formulas.
Random Struct. Algorithms 10(3): 337-351 (1997) |
| 14 | EE | Petr Savický,
Stanislav Zák:
A Lower Bound on Branching Programs Reading Some Bits Twice.
Theor. Comput. Sci. 172(1-2): 293-301 (1997) |
| 1996 |
|---|
| 13 | | Hanno Lefmann,
Pavel Pudlák,
Petr Savický:
On Sparse Parity Chack Matrices (Extended Abstract).
COCOON 1996: 41-49 |
| 12 | EE | Petr Savický,
Stanislav Zák:
A large lower bound for 1-branching programs
Electronic Colloquium on Computational Complexity (ECCC) 3(36): (1996) |
| 11 | EE | Petr Savický,
Stanislav Zák:
A hierarchy for (1,+k)-branching programs with respect to k
Electronic Colloquium on Computational Complexity (ECCC) 3(50): (1996) |
| 1995 |
|---|
| 10 | | Hanno Lefmann,
Petr Savický:
Some Typical Properties of Large AND/OR Boolean Formulas.
MFCS 1995: 237-246 |
| 9 | EE | Petr Savický:
Bent functions and random boolean formulas.
Discrete Mathematics 147(1-3): 211-234 (1995) |
| 8 | | Beate Bollig,
Martin Hühne,
Stefan Pölt,
Petr Savický:
On the Average Case Circuit Delay of Disjunction.
Parallel Processing Letters 5: 275-280 (1995) |
| 7 | | Petr Savický:
Improved Boolean Formulas for the Ramsey Graphs.
Random Struct. Algorithms 6(4): 407-416 (1995) |
| 1994 |
|---|
| 6 | | Petr Savický,
Ingo Wegener:
Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams.
FSTTCS 1994: 390-401 |
| 5 | EE | Petr Savický:
On the Bent Boolean Functions That are Symmetric.
Eur. J. Comb. 15(4): 407-410 (1994) |
| 1993 |
|---|
| 4 | | 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): 203-210 (1993) |
| 1990 |
|---|
| 3 | EE | Petr Savický:
Random boolean formulas representing any boolean function with asymptotically equal probability.
Discrete Mathematics 83(1): 95-103 (1990) |
| 1988 |
|---|
| 2 | | Petr Savický:
Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract).
MFCS 1988: 512-517 |
| 1 | | Pavel Pudlák,
Vojtech Rödl,
Petr Savický:
Graph Complexity.
Acta Inf. 25(5): 515-535 (1988) |
