( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Relating Proof Complexity Measures and Practical Hardness of SAT.

, , , и . CP, том 7514 из Lecture Notes in Computer Science, стр. 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.

Arie Nabrings

Arie Hartog

Arie Klerk

Horst Aries

Katrin Leonie Aries

 

Другие публикации лиц с тем же именем

Efficient Sample Extractors for Juntas with Applications., , и . ICALP (1), том 6755 из Lecture Notes in Computer Science, стр. 545-556. Springer, (2011)Testing Graph Isomorphism., и . SIAM J. Comput., 38 (1): 207-225 (2008)Underapproximation for model-checking based on universal circuits., и . Inf. Comput., 208 (4): 315-326 (2010)Hardness and Algorithms for Rainbow Connectivity., , , и . STACS, том 3 из LIPIcs, стр. 243-254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Underapproximation for Model-Checking Based on Random Cryptographic Constructions., и . CAV, том 4590 из Lecture Notes in Computer Science, стр. 339-351. Springer, (2007)Incremental formal verification of hardware., , , , и . FMCAD, стр. 135-143. FMCAD Inc., (2011)On the query complexity of testing orientations for being Eulerian., , , , и . ACM Trans. Algorithms, 8 (2): 15:1-15:41 (2012)Query Complexity Lower Bounds for Reconstruction of Codes., , и . Electron. Colloquium Comput. Complex., (2010)On the power of conditional samples in distribution testing., , , и . ITCS, стр. 561-580. ACM, (2013)Query Complexity Lower Bounds for Reconstruction of Codes., , и . Theory of Computing, (2014)