Author of the publication

Complexity of Distributions and Average-Case Hardness.

, , and . ISAAC, volume 64 of LIPIcs, page 38:1-38:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

 

Other publications of authors with the same name

Monotone circuit lower bounds from resolution., , , and . STOC, page 902-911. ACM, (2018)Heuristic Time Hierarchies via Hierarchies for Sampling Distributions., , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 201-211. Springer, (2015)Lower Bounds for Splittings by Linear Combinations., and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 372-383. Springer, (2014)On the probabilistic closure of the loose unambiguous hierarchy., and . Inf. Process. Lett., 115 (9): 725-730 (2015)Coverage Path Planning Optimization of Heterogeneous UAVs Group for Precision Agriculture., , , , , , , , , and . IEEE Access, (2023)A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion., and . Electron. Colloquium Comput. Complex., (2022)Robust Quantization for Polycube Maps., , , , , and . Comput. Aided Des., (2022)In the Quest for Scale-optimal Mappings., , , , and . ACM Trans. Graph., 43 (1): 8:1-8:16 (February 2024)(Semi)Algebraic proofs over ±1 variables.. STOC, page 78-90. ACM, (2020)Trade-Offs Between Size and Degree in Polynomial Calculus., , , and . ITCS, volume 151 of LIPIcs, page 72:1-72:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)