( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Semialgebraic Proofs, IPS Lower Bounds, and the \(\tau\)-Conjecture: Can a Natural Number be Negative?

, , , и . SIAM J. Comput., 53 (3): 648-700 (2024)

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.

No persons found for author name Tzameret, Iddo
add a person with the name Tzameret, Iddo
 

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

Resolution with Counting: Dag-Like Lower Bounds and Different Moduli., и . ITCS, том 151 из LIPIcs, стр. 19:1-19:37. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness., и . Electron. Colloquium Comput. Complex., (2023)Resolution with Counting: Dag-Like Lower Bounds and Different Moduli., и . Comput. Complex., 30 (1): 2 (2021)Algebraic Proofs over Noncommutative Formulas.. TAMC, том 6108 из Lecture Notes in Computer Science, стр. 60-71. Springer, (2010)Short proofs for the determinant identities., и . STOC, стр. 193-212. ACM, (2012)Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem - (Extended Abstract).. ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 1015-1026. Springer, (2014)Proof Complexity Lower Bounds from Algebraic Circuit Complexity., , , и . Theory Comput., (2021)Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas., и . Electron. Colloquium Comput. Complex., (2011)Studies in algebraic and propositional proof complexity. Tel Aviv University, Israel, (2008)Tel Aviv University Library.The Proof Complexity of Polynomial Identities., и . CCC, стр. 41-51. IEEE Computer Society, (2009)