The following pages link to Arnab Bhattacharyya (Q396921):
Displayed 46 items.
- A bipartite graph with non-unimodal independent set sequence (Q396922) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- (Q519964) (redirect page) (← links)
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
- Approximation algorithms for spanner problems and directed Steiner forest (Q1951575) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Polynomial Decompositions in Polynomial Time (Q2921399) (← links)
- On the convergence of the Hegselmann-Krause system (Q2986859) (← links)
- (Q3002831) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (Q3012848) (← links)
- Testing Permanent Oracles – Revisited (Q3167410) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- On the hardness of learning sparse parities (Q4606280) (← links)
- An Optimal Algorithm for ℓ <sub>1</sub> -Heavy Hitters in Insertion Streams and Related Problems (Q4629972) (← links)
- (Q4633906) (← links)
- On Higher-Order Fourier Analysis over Non-Prime Fields (Q4636456) (← links)
- Transitive-Closure Spanners (Q4910569) (← links)
- Testing Linear-Invariant Non-linear Properties: A Short Report (Q4933376) (← links)
- Optimal Testing of Reed-Muller Codes (Q4933377) (← links)
- Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs (Q4973884) (← links)
- A unified framework for testing linear‐invariant properties (Q4982614) (← links)
- (Q5002633) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- Property Testing (Q5035409) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem (Q5056405) (← links)
- An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
- Algorithmic regularity for polynomials and applications (Q5363110) (← links)
- Lower bounds for constant query affine-invariant LCCs and LTCs (Q5368746) (← links)
- Testing Linear-Invariant Non-Linear Properties (Q5389972) (← links)
- (Q5417609) (← links)
- Tight Lower Bounds for 2-query LCCs over Finite Fields (Q5495035) (← links)
- Every locally characterized affine-invariant property is testable (Q5495813) (← links)
- Testing Low Complexity Affine-Invariant Properties (Q5741806) (← links)
- (Q5743465) (← links)
- (Q5875793) (← links)
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners (Q5891744) (← links)
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners (Q5901180) (← links)
- Improved learning of \(k\)-parities (Q5916259) (← links)
- Improved learning of \(k\)-parities (Q5918966) (← links)
- Near-optimal learning of tree-structured distributions by Chow-Liu (Q6065179) (← links)
- Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu (Q6110527) (← links)
- Using higher-order Fourier analysis over general fields (Q6261471) (← links)
- Combinatorial lower bounds for 3-query LDCs (Q6329800) (← links)