I agree that this site is using cookies. You can find further informations here.
X
Paraashar, Manaswi
32  results:
Search for persons X
?
1

Local Correction of Linear Functions over the Boolean Cube:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Amireddy, Prashanth ; Behera, Amik Raj ; Paraashar, Manaswi.. - p. 764-775 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Disjointness through the Lens of Vapnik–Chervonenkis Dimens..:

Bhattacharya, Anup ; Chakraborty, Sourav ; Ghosh, Arijit..
computational complexity.  31 (2022)  2 - p. , 2022
Link: https://doi.org/10.1007/..
 
?
3

Two new results about quantum exact learning:

Arunachalam, Srinivasan ; Chakraborty, Sourav ; Lee, Troy..
Quantum.  5 (2021)  - p. 587 , 2021
Link: https://doi.org/10.22331..
 
?
4

Quantum query-to-communication simulation needs a logarithm..:

, In: Proceedings of the 35th Computational Complexity Conference,
Chakraborty, Sourav ; Chattopadhyay, Arkadev ; Mande, Nikhil S.. - p. 1-15 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Local Correction of Linear Functions over the Boolean Cube:

Amireddy, Prashanth ; Behera, Amik Raj ; Paraashar, Manaswi..
https://pure.au.dk/portal/en/publications/c2e50ad5-a4e9-4676-b6c6-db60b188d9ac.  , 2024
Link: https://pure.au.dk/porta..
 
?
6

Randomized and quantum query complexities of finding a king..:

Mande, Nikhil S ; Paraashar, Manaswi ; Saurabh, Nitin
http://arxiv.org/abs/2308.02472.  , 2023
Link: http://arxiv.org/abs/230..
 
?
7

On the Composition of Randomized Query Complexity and Appro..:

Chakraborty, Sourav ; Kayal, Chandrima ; Mittal, Rajat...
Chakraborty , S , Kayal , C , Mittal , R , Paraashar , M , Sanyal , S & Saurabh , N 2023 , On the Composition of Randomized Query Complexity and Approximate Degree . in N Megow & A Smith (eds) , Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques, APPROX/RANDOM 2023 . , 63 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Dagstuhl , Leibniz International Proceedings in Informatics, LIPIcs , vol. 275 , 26th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2023 and the 27th International Conference on Randomization and Computation, RANDOM 2023 , Atlanta , United States , 11/09/2023 . https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63.  , 2023
Link: https://pure.au.dk/porta..
 
?
8

On the Composition of Randomized Query Complexity and Appro..:

Chakraborty, Sourav ; Kayal, Chandrima ; Mittal, Rajat...
http://arxiv.org/abs/2307.03900.  , 2023
Link: http://arxiv.org/abs/230..
 
?
9

Computational Complexity of Discrete Problems (Dagstuhl Sem..:

Gál, Anna ; Mahajan, Meena ; Santhanam, Rahul..
Is Part Of Dagstuhl Reports, Volume 13, Issue 3 (2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
10

Randomized and Quantum Query Complexities of Finding a King..:

Mande, Nikhil S ; Paraashar, Manaswi ; Saurabh, Nitin
Is Part Of LIPIcs, Volume 284, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
11

Linear isomorphism testing of Boolean functions with small ..:

Ghosh, Arijit ; Kayal, Chandrima ; Paraashar, Manaswi.
http://arxiv.org/abs/2308.02662.  , 2023
Link: http://arxiv.org/abs/230..
 
?
12

On the Composition of Randomized Query Complexity and Appro..:

Chakraborty, Sourav ; Kayal, Chandrima ; Mittal, Rajat...
Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
13

Disjointness through the Lens of Vapnik–Chervonenkis Dimens..:

Bhattacharya, Anup ; Chakraborty, Sourav ; Ghosh, Arijit..
Bhattacharya , A , Chakraborty , S , Ghosh , A , Mishra , G & Paraashar , M 2022 , ' Disjointness through the Lens of Vapnik–Chervonenkis Dimension : Sparsity and Beyond ' , Computational Complexity , vol. 31 , no. 2 , 9 . https://doi.org/10.1007/s00037-022-00225-6.  , 2022
Link: https://pure.au.dk/porta..
 
?
14

Counting and Sampling from Substructures Using Linear Algeb..:

Bishnu, Arijit ; Ghosh, Arijit ; Mishra, Gopinath.
Is Part Of LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022).  , 2022
Link: https://doi.org/10.4230/..
 
?
15

Counting and Sampling from Substructures Using Linear Algeb..:

Bishnu, Arijit ; Ghosh, Arijit ; Mishra, Gopinath.
Bishnu , A , Ghosh , A , Mishra , G & Paraashar , M 2022 , Counting and Sampling from Substructures Using Linear Algebraic Queries . in A Dawar & V Guruswami (eds) , 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022 . , 8 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Leibniz International Proceedings in Informatics, LIPIcs , vol. 250 , 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022 , Chennai , India , 18/12/2022 . https://doi.org/10.4230/LIPIcs.FSTTCS.2022.8.  , 2022
Link: https://pure.au.dk/porta..
 
1-15