( en | de | ru )

 

Disambiguation of "Kalla, Priyank"

Author of the publication

copydeleteadd this publication to your clipboard
Strategies for solving the Boolean satisfiability problem using binary decision diagrams.

, , and . J. Syst. Archit., 47 (6): 491-503 (2001)

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.

Reinhard Kalla

Priyank Shukla

Julius Kalla

Stefan Kalla

Hamoudi Kalla

 

Other publications of authors with the same name

Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm., , , and . CP, volume 9892 of Lecture Notes in Computer Science, page 859-875. Springer, (2016)Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra., , , and . IEEE Trans. Very Large Scale Integr. Syst., 16 (4): 376-387 (2008)Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques., , , , , and . FMCAD, page 1-9. IEEE, (2018)Formal Verification of Galois Field Multipliers Using Computer Algebra Techniques., and . VLSI Design, page 388-393. IEEE Computer Society, (2012)Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths., , , and . ICCD, page 215-220. IEEE Computer Society, (2005)On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields., , , , , and . VLSI-SoC, page 49-54. IEEE, (2018)Optimization of Arithmetic Datapaths with Finite Word-Length Operands., , and . ASP-DAC, page 511-516. IEEE Computer Society, (2007)A Gröbner Basis Approach to CNF-Formulae Preprocessing., and . TACAS, volume 4424 of Lecture Notes in Computer Science, page 618-631. Springer, (2007)A comprehensive approach to the partial scan problem using implicit state enumeration., and . ITC, page 651-657. IEEE Computer Society, (1998)Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases., , and . DAC, page 152:1-152:6. ACM, (2014)