Farzan Byramji

Orcid: 0000-0001-6154-0463

According to our database1, Farzan Byramji authored at least 4 papers between 2024 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Lower bounds for the Bit Pigeonhole Principle in Bounded-Depth Resolution over Parities.
Electron. Colloquium Comput. Complex., 2025

Lifting to Randomized Parity Decision Trees.
Proceedings of the Approximation, 2025

2024
Query complexity of Boolean functions on slices.
Discret. Math., 2024

Relations Between Monotone Complexity Measures Based on Decision Tree Complexity.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024


  Loading...