( en | de | ru )

 

Disambiguation of "Smal, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Lifting dichotomies.

, , and . Electron. Colloquium Comput. Complex., (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. You can also use the button next to the name to display some publications already assigned to the person.

Elke Smalla

Kornelia Smalla

Thomas Smaltschinski

Helmut Smalla

Roman Smalʹ-Stocʹkyj

 

Other publications of authors with the same name

On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography., , , and . Theory Comput. Syst., 51 (2): 179-195 (2012)Proving Unsatisfiability with Hitting Formulas., , , , and . CoRR, (2023)New Bounds on the Half-Duplex Communication Complexity., , , , and . SOFSEM, volume 12607 of Lecture Notes in Computer Science, page 233-248. Springer, (2021)Prediction from Partial Information and Hindsight, an Alternative Proof., and . Electron. Colloquium Comput. Complex., (2017)Lifting Dichotomies., , and . CCC, volume 300 of LIPIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Toward Better Depth Lower Bounds: The XOR-KRW Conjecture., and . CCC, volume 200 of LIPIcs, page 38:1-38:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Circuit size lower bounds and #SAT upper bounds through a general framework., , , and . Electron. Colloquium Comput. Complex., (2016)Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games., , and . ISAAC, volume 248 of LIPIcs, page 66:1-66:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Proving Unsatisfiability with Hitting Formulas., , , , and . ITCS, volume 287 of LIPIcs, page 48:1-48:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , and . Theor. Comput. Sci., (2018)