( en | de | ru )

 

Disambiguation of "Matsliah, Arie"

Author of the publication

copydeleteadd this publication to your clipboard
Relating Proof Complexity Measures and Practical Hardness of SAT.

, , , and . CP, volume 7514 of Lecture Notes in Computer Science, page 316-331. Springer, (2012)

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.

Arie Nabrings

Arie Hartog

Arie Klerk

Horst Aries

Katrin Leonie Aries

 

Other publications of authors with the same name

Testing Graph Isomorphism., and . SIAM J. Comput., 38 (1): 207-225 (2008)Efficient Sample Extractors for Juntas with Applications., , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 545-556. Springer, (2011)Underapproximation for Model-Checking Based on Random Cryptographic Constructions., and . CAV, volume 4590 of Lecture Notes in Computer Science, page 339-351. Springer, (2007)Underapproximation for model-checking based on universal circuits., and . Inf. Comput., 208 (4): 315-326 (2010)Hardness and Algorithms for Rainbow Connectivity., , , and . STACS, volume 3 of LIPIcs, page 243-254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Incremental formal verification of hardware., , , , and . FMCAD, page 135-143. FMCAD Inc., (2011)Query Complexity Lower Bounds for Reconstruction of Codes., , and . ICS, page 264-274. Tsinghua University Press, (2011)On the power of conditional samples in distribution testing., , , and . ITCS, page 561-580. ACM, (2013)On the query complexity of testing orientations for being Eulerian., , , , and . ACM Trans. Algorithms, 8 (2): 15:1-15:41 (2012)Augmenting Clause Learning with Implied Literals - (Poster Presentation)., , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 500-501. Springer, (2012)