Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Tzameret, Iddo
58  Ergebnisse:
Personensuche X
?
1

First-order reasoning and efficient semi-algebraic proofs:

Part, Fedor ; Thapen, Neil ; Tzameret, Iddo
Annals of Pure and Applied Logic.  176 (2025)  1 - p. 103496 , 2025
Link: https://doi.org/10.1016/..
 
?
2

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lift..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Hakoniemi, Tuomas ; Limaye, Nutan ; Tzameret, Iddo - p. 1396-1404 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymb..:

Alekseev, Yaroslav ; Grigoriev, Dima ; Hirsch, Edward A..
SIAM Journal on Computing.  53 (2024)  3 - p. 648-700 , 2024
Link: https://doi.org/10.1137/..
 
?
4

Simple Hard Instances for Low-Depth Algebraic Proofs:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Govindasamy, Nashlen ; Hakoniemi, Tuomas ; Tzameret, Iddo - p. 188-199 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Uniform, Integral, and Feasible Proofs for the Determinant ..:

Tzameret, Iddo ; Cook, Stephen A.
Journal of the ACM.  68 (2021)  2 - p. 1-80 , 2021
Link: https://doi.org/10.1145/..
 
?
6

Uniform, Integral, and Feasible Proofs for the Determinant ..:

Tzameret, Iddo ; Cook, Stephen A.
Journal of the ACM (JACM).  68 (2021)  2 - p. 1-80 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

Iterated lower bound formulas: a diagonalization-based appr..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Santhanam, Rahul ; Tzameret, Iddo - p. 234-247 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

First-Order Reasoning and Efficient Semi-Algebraic Proofs:

, In: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
Part, Fedor ; Thapen, Neil ; Tzameret, Iddo - p. 1-13 , 2021
Link: https://doi.org/10.1109/..
 
?
9

Resolution with Counting: Dag-Like Lower Bounds and Differe..:

Part, Fedor ; Tzameret, Iddo
computational complexity.  30 (2021)  1 - p. , 2021
Link: https://doi.org/10.1007/..
 
?
10

First-order reasoning and efficient semi-algebraic proofs:

, In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
Part, Fedor ; Thapen, Neil ; Tzameret, Iddo - p. 1-13 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Semi-algebraic proofs, IPS lower bounds, and the τ-conjectu..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Alekseev, Yaroslav ; Grigoriev, Dima ; Hirsch, Edward A.. - p. 54-67 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Characterizing Propositional Proofs as Noncommutative Formu..:

Li, Fu ; Tzameret, Iddo ; Wang, Zhengyu
SIAM Journal on Computing.  47 (2018)  4 - p. 1424-1462 , 2018
Link: https://doi.org/10.1137/..
 
?
13

Uniform, integral and efficient proofs for the determinant ..:

, In: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science,
Tzameret, Iddo ; Cook, Stephen A. - p. 1-12 , 2017
Link: https://dl.acm.org/doi/1..
 
?
14

Algebraic proof complexity: progress, frontiers and challen..:

Pitassi, Toniann ; Tzameret, Iddo
ACM SIGLOG News.  3 (2016)  3 - p. 21-43 , 2016
Link: https://doi.org/10.1145/..
 
?
15

Algebraic proof complexity : progress, frontiers and cha..:

Pitassi, Toniann ; Tzameret, Iddo
ACM SIGLOG News.  3 (2016)  3 - p. 21-43 , 2016
Link: https://dl.acm.org/doi/1..
 
1-15