Výsledky vyhľadávania - "Randomized query complexity"

Randomized query composition and product distributions

Autori: Sanyal, Swagato Swagato Sanyal

Prispievatelia: Sanyal, Swagato Swagato Sanyal

Predmety: Computer Science - Computational Complexity, Boolean function complexity, Decision Tree, Computer Science - Data Structures and Algorithms, Randomized query complexity, Analysis of Boolean functions, ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2401.15352
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.56

On the Composition of Randomized Query Complexity and Approximate Degree

Autori: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat a ďalší

Prispievatelia: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat a ďalší

Zdroj: 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, 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

Predmety: FOS: Computer and information sciences, Computer Science - Computational Complexity, Approximate degree, Partial functions, Randomized Query Complexity, Composition Theorem, ddc:004, Boolean functions, Computational Complexity (cs.CC)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2307.03900
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.63
https://pure.au.dk/portal/en/publications/316f50f0-e99c-4951-b65d-e22f17709702
http://www.scopus.com/inward/record.url?scp=85172027884&partnerID=8YFLogxK
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63

Randomized and quantum query complexities of finding a king in a tournament

Autori: Mande, Nikhil S. Paraashar, Manaswi Saurabh, Nitin a ďalší

Prispievatelia: Mande, Nikhil S. Paraashar, Manaswi Saurabh, Nitin a ďalší

Zdroj: Mande, N S, Paraashar, M & Saurabh, N 2023, Randomized and Quantum Query Complexities of Finding a King in a Tournament . in P Bouyer, S Srinivasan & S Srinivasan (eds), 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023 ., 30, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 284, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, Hyderabad, India, 18/12/2023 . https://doi.org/10.4230/LIPIcs.FSTTCS.2023.30

Predmety: search problems, FOS: Computer and information sciences, Quantum Physics, randomized query complexity, FOS: Physical sciences, Computational Complexity (cs.CC), quantum computing, Computer Science - Computational Complexity, Query complexity, Computer Science - Data Structures and Algorithms, tournament solutions, Data Structures and Algorithms (cs.DS), ddc:004, Quantum Physics (quant-ph)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2308.02472
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.30
https://curis.ku.dk/ws/files/390880150/LIPIcs.FSTTCS.2023.30.pdf

All Classical Adversary Methods are Equivalent for Total Functions

Autori: Ambainis, Andris Kokainis, Martins Prusis, Krisjanis a ďalší

Prispievatelia: Ambainis, Andris Kokainis, Martins Prusis, Krisjanis a ďalší

Predmety: Randomized Query Complexity, Lower Bounds, Adversary Bounds, Fractional Block Sensitivity

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.8

Dostupnosť: https://doi.org/10.4230/LIPIcs.STACS.2018.8
https://nbn-resolving.org/urn:nbn:de:0030-drops-84953
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.8

Randomized Query Complexity of Sabotaged and Composed Functions

Autori: Shalev, Ben-David Kothari, Robin Ben-David Shalev and Robin Kothari

Prispievatelia: Shalev, Ben-David Kothari, Robin Ben-David Shalev and Robin Kothari

Predmety: Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.60

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2016.60
https://nbn-resolving.org/urn:nbn:de:0030-drops-62233
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.60

Randomized and Quantum Query Complexities of Finding a King in a Tournament

Autori: Bouyer, Patricia Srinivasan, Srikanth Mande, Nikhil S. a ďalší

Zdroj: Mande , N S , Paraashar , M & Saurabh , N 2023 , Randomized and Quantum Query Complexities of Finding a King in a Tournament . in P Bouyer , S Srinivasan & S Srinivasan (eds) , 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023 . , 30 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Leibniz International Proceedings in Informatics, LIPIcs , vol. 284 , 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023 , Hyderabad , India , 18/12/2023 .

Témy: quantum computing, Query complexity, randomized query complexity, search problems, tournament solutions, contributionToPeriodical

URL: https://researchprofiles.ku.dk/da/publications/randomized-and-quantum-query-complexities-of-finding-a-king-in-a-tournament(e1f3eced-4a8a-4c8d-abdb-6054ca17ec6c).html
https://doi.org/10.4230/LIPIcs.FSTTCS.2023.30
https://curis.ku.dk/ws/files/390880150/LIPIcs.FSTTCS.2023.30.pdf