PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Savický, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
DNF tautologies with a limited number of occurrences of every variable.

, and . Theor. Comput. Sci., 238 (1-2): 495-498 (2000)

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.

Dr. rer. nat. Petr Siyushev University of Stuttgart

Dr. rer. pol. Dimitri Petrik University of Stuttgart

Jona Petri University of Stuttgart

Aleko Petrov

Dr. Taras Petrenko University of Stuttgart

 

Other publications of authors with the same name

On the Bent Boolean Functions That are Symmetric.. Eur. J. Comb., 15 (4): 407-410 (1994)Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams., and . Acta Inf., 34 (4): 245-256 (1997)Measures of Word Commonness., and . Journal of Quantitative Linguistics, 9 (3): 215-231 (2002)One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete., , and . SIAM J. Comput., 22 (1): 203-210 (1993)The number of Boolean functions computed by formulas of a given size., and . Random Struct. Algorithms, 13 (3-4): 349-382 (1998)Propagation complete encodings of smooth DNNF theories., and . CoRR, (2019)On determinism versus unambiquous nondeterminism for decision trees. Electronic Colloquium on Computational Complexity (ECCC), (2002)Triangulation Heuristics for BN2O Networks., and . ECSQARU, volume 5590 of Lecture Notes in Computer Science, page 566-577. Springer, (2009)Combining Pairwise Classifiers with Stacking., and . IDA, volume 2810 of Lecture Notes in Computer Science, page 219-229. Springer, (2003)Graph Complexity., , and . Acta Inf., 25 (5): 515-535 (1988)