Programming Section

Research output

  1. On the Relationship Between the Complexity of Decidability and Decomposability of First-Order Theories

    Research output: Contribution to journalArticlepeer-review

  2. Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation

    Research output: Contribution to journalArticlepeer-review

  3. The complexity of AND—decomposition of Boolean functions

    Research output: Contribution to journalArticlepeer-review

View all (15) »

ID: 3449889