( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares.

, , и . MFCS, том 241 из LIPIcs, стр. 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Nicola Galabaroff

Rudolf Nicola

Nicola Damianoff

Nicola Degen

Nicola Damrich

 

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

Optimality of size-width tradeoffs for resolution., и . Comput. Complex., 10 (4): 261-276 (2001)Space proof complexity for random 3-CNFs., , , , , и . Inf. Comput., (2017)Vertex-connectivity for node failure identification in Boolean Network Tomography., , и . Inf. Process. Lett., (февраля 2024)On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies., , и . ACM Trans. Comput. Log., 17 (4): 26 (2016)Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography., и . Theor. Comput. Sci., (2022)Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography., и . ICDCS, стр. 212-222. IEEE Computer Society, (2018)Cops-Robber Games and the Resolution of Tseitin Formulas., , и . SAT, том 10929 из Lecture Notes in Computer Science, стр. 311-326. Springer, (2018)On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares., , и . MFCS, том 241 из LIPIcs, стр. 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Paris-Harrington Tautologies., , и . CCC, стр. 93-103. IEEE Computer Society, (2011)Resolution and the Binary Encoding of Combinatorial Principles., , и . CCC, том 137 из LIPIcs, стр. 6:1-6:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)