( en | de | ru )

 

Disambiguation of "Savický, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Learning Random Numbers: a MATLAB Anomaly.

, and . Applied Artificial Intelligence, 22 (3): 254-265 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jan Savicky

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

 

Other publications of authors with the same name

Some Typical Properties of Large AND/OR Boolean Formulas., and . MFCS, volume 969 of Lecture Notes in Computer Science, page 237-246. Springer, (1995)A Hierarchy for (1, +k)-Branching Programs with Respect of k., and . MFCS, volume 1295 of Lecture Notes in Computer Science, page 478-487. Springer, (1997)Graph Complexity., , and . Acta Inf., 25 (5): 515-535 (1988)Improved Boolean Formulas for the Ramsey Graphs.. Random Struct. Algorithms, 6 (4): 407-416 (1995)A Lower Bound on CNF Encodings of the At-Most-One Constraint., , and . SAT, volume 10491 of Lecture Notes in Computer Science, page 412-428. Springer, (2017)Upper Bounds on the Approximation Rates of Real-valued Boolean Functions by Neural Networks., , and . ICANNGA, page 495-499. Springer, (1997)DNF tautologies with a limited number of occurrences of every variable., and . Theor. Comput. Sci., 238 (1-2): 495-498 (2000)A Lower Bound on Branching Programs Reading Some Bits Twice., and . Theor. Comput. Sci., 172 (1-2): 293-301 (1997)On Random Orderings of Variables for Parity OBDDs. Electron. Colloquium Comput. Complex., (1998)Complexity and Probability of Some Boolean Formulas.. Comb. Probab. Comput., 7 (4): 451-463 (1998)