Farzan Byramji

According to our database, Farzan Byramji authored at least 9 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Hard-to-Sample Distributions from Robust Extractors.

Farzan Byramji, Daniel Kane, Jackson Morris, Anthony Ostuni

Electron. Colloquium Comput. Complex., 2026

On the Advantage of Adaptivity for Sampling with Cell Probes.

Farzan Byramji, Daniel Kane, Jackson Morris, Anthony Ostuni

Electron. Colloquium Comput. Complex., 2026

Quantum-Classical Equivalence for AND-Functions.

Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett

Electron. Colloquium Comput. Complex., 2026

Lower Bounds for Near-Quadratic-Depth Resolution over Parities.

Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Russell Impagliazzo

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Lower Bounds for Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities.

Farzan Byramji, Russell Impagliazzo

CoRR, November, 2025

Lower bounds for the Bit Pigeonhole Principle in Bounded-Depth Resolution over Parities.

Farzan Byramji, Russell Impagliazzo

Electron. Colloquium Comput. Complex., 2025

Lifting to Randomized Parity Decision Trees.

Farzan Byramji, Russell Impagliazzo

Proceedings of the Approximation, 2025

2024

Query complexity of Boolean functions on slices.

Farzan Byramji

Discret. Math., 2024

Relations Between Monotone Complexity Measures Based on Decision Tree Complexity.

Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024