Výsledky vyhledávání - Randomized query complexity

Randomized query composition and sabotage complexity

Autoři: Swagato Sanyal

Zdroj: ACM Transactions on Computation Theory.

The randomized query complexity of finding a Tarski fixed point on the Boolean hypercube

Autoři: Brânzei, Simina Phillips, Reed Recker, Nicholas

Zdroj: Discrete Mathematics. 348:114698

Témata: Computer Science and Game Theory, FOS: Computer and information sciences, Computational Complexity, Computational Complexity (cs.CC), Computer Science and Game Theory (cs.GT)

Přístupová URL adresa: http://arxiv.org/abs/2409.03751

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

Autoři: Mande, Nikhil S. Paraashar, Manaswi Saurabh, Nitin a další

Přispěvatelé: Mande, Nikhil S. Paraashar, Manaswi Saurabh, Nitin a další

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

Témata: 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 souboru: application/pdf

Pří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

On the Composition of Randomized Query Complexity and Approximate Degree

Autoři: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat a další

Přispěvatelé: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat a další

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

Témata: 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 souboru: application/pdf

Pří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

Computer-assisted proof of lower bounds on the randomized query complexity of certain read-once threshold functions

Autoři: Leonardos, Nikos

Témata: lower bounds, read-once functions, Decision trees, randomized computation, query complexity

An optimal separation of randomized and Quantum query complexity

Autoři: Alexander A. Sherstov Andrey A. Storozhenko Pei Wu

Zdroj: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. :1289-1302

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Quantum Physics, 0202 electrical engineering, electronic engineering, information engineering, FOS: Physical sciences, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Quantum Physics (quant-ph), 01 natural sciences

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3406325.3451019
http://arxiv.org/abs/2008.10223
https://www.arxiv-vanity.com/papers/2008.10223/
https://dl.acm.org/doi/pdf/10.1145/3406325.3451019
https://doi.org/10.1145/3406325.3451019
http://acm-stoc.org/stoc2021/accepted-papers.html#26
https://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#SherstovSW21

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

Autoři: Bouyer, Patricia Srinivasan, Srikanth Mande, Nikhil S. a další

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émata: 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

Randomized query composition and product distributions

Autoři: Sanyal, Swagato Swagato Sanyal

Přispěvatelé: Sanyal, Swagato Swagato Sanyal

Témata: 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 souboru: application/pdf

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

Separation Between Deterministic and Randomized Query Complexity

Autoři: Mukhopadhyay, Sagnik Radhakrishnan, Jaykumar Sanyal, Swagato

Zdroj: SIAM journal on computing (Print). 47(4):1644-1666

Témata: deterministic decision tree, randomized decision tree, query complexity, models of computation

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235160

Quadratically Tight Relations for Randomized Query Complexity

Autoři: Srijita Kundu Swagato Sanyal Miklos Santha a další

Přispěvatelé: Srijita Kundu Swagato Sanyal Miklos Santha a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783319905297

Témata: [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, [INFO] Computer Science [cs], 16. Peace & justice, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1708.00822
https://rd.springer.com/chapter/10.1007/978-3-319-90530-3_18
https://arxiv.org/abs/1708.00822
https://dblp.uni-trier.de/db/journals/corr/corr1708.html#abs-1708-00822
https://link.springer.com/chapter/10.1007/978-3-319-90530-3_18
https://link.springer.com/article/10.1007/s00224-019-09935-x
https://dblp.uni-trier.de/db/journals/mst/mst64.html#JainKKLSSV20
https://hal.science/hal-02351409v1
https://doi.org/10.1007/s00224-019-09935-x

Optimal Composition Theorem for Randomized Query Complexity

Autoři: Gavinsky, D Lee, T Santha, M a další

Témata: 0802 Computation Theory and Mathematics, 1702 Cognitive Sciences, Journal Article

URL: http://hdl.handle.net/10453/179036
THEORY OF COMPUTING
10.4086/toc.2023.v019.a009

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract

Autoři: Shalev Ben-David Eric Blais

Zdroj: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). :240-246

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/focs/focs2020.html#Ben-DavidB20

When Is Amplification Necessary for Composition in Randomized Query Complexity?

Autoři: Ben-David, Shalev Göös, Mika Kothari, Robin a další

Přispěvatelé: Ben-David, Shalev Göös, Mika Kothari, Robin a další

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, composition, 0202 electrical engineering, electronic engineering, information engineering, Amplification, query complexity, 0102 computer and information sciences, 02 engineering and technology, ddc:004, Computational Complexity (cs.CC), 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2006.10957
https://drops.dagstuhl.de/opus/volltexte/2020/12631/pdf/LIPIcs-APPROX28.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2006.html#abs-2006-10957
https://drops.dagstuhl.de/opus/volltexte/2020/12631/
https://arxiv.org/abs/2006.10957
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.28

Optimal Separation and Strong Direct Sum for Randomized Query Complexity

Autoři: Blais, E. Brody, Joshua Eric Blais and Joshua Brody

Přispěvatelé: Blais, E. Brody, Joshua Eric Blais and Joshua Brody

Zdroj: arXiv: Computational Complexity.

Témata: FOS: Computer and information sciences, Computer Sciences, Decision trees, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), communication complexity}, 01 natural sciences, Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering, query complexity, communication complexity, ddc:004, F.1.3

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1908.01020
https://arxiv.org/abs/1908.01020
https://arxiv.org/pdf/1908.01020v1
https://drops.dagstuhl.de/opus/volltexte/2019/10851/
https://drops.dagstuhl.de/opus/volltexte/2019/10851/pdf/LIPIcs-CCC-2019-29.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-01020
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2019.29
https://doi.org/10.4230/LIPIcs.CCC.2019.29
http://ui.adsabs.harvard.edu/abs/2019arXiv190801020B/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.29

A New Minimax Theorem for Randomized Algorithms: A new minimax theorem for randomized algorithms

Autoři: Shalev Ben-David Eric Blais

Zdroj: Journal of the ACM. 70:1-58

Témata: FOS: Computer and information sciences, minimax, Quantum Physics, Networks and circuits as models of computation, circuit complexity, quantum computation, Randomized algorithms, FOS: Physical sciences, Communication complexity, information complexity, polynomial degree complexity, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Quantum computation, randomized computation, 0202 electrical engineering, electronic engineering, information engineering, query complexity, communication complexity, Quantum Physics (quant-ph)

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2002.10802

A composition theorem for randomized query complexity via max conflict complexity

Autoři: Gavinsky, Dmitry Lee, Troy Santha, Miklos a další

Přispěvatelé: Gavinsky, Dmitry Lee, Troy Santha, Miklos a další

Témata: FOS: Computer and information sciences, lower bounds, Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering, query complexity, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, 02 engineering and technology, ddc:004, Computational Complexity (cs.CC), 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1811.10752
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.64
https://hal.science/hal-02350840v1
http://hdl.handle.net/11104/0298723

Randomized query complexity of sabotaged and composed functions

Autoři: Shalev, Ben-David Kothari, Robin Ben-David Shalev and Robin Kothari

Přispěvatelé: Shalev, Ben-David Kothari, Robin Ben-David Shalev and Robin Kothari

Zdroj: arXiv: Computational Complexity.

Témata: FOS: Computer and information sciences, Quantum Physics, partition bound, Randomized query complexity, decision tree complexity, FOS: Physical sciences, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, lifting theorem, Computer Science - Computational Complexity, composition theorem, 0202 electrical engineering, electronic engineering, information engineering, ddc:004, Quantum Physics (quant-ph)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1605.09071
https://arxiv.org/pdf/1605.09071.pdf
http://ui.adsabs.harvard.edu/abs/2016arXiv160509071B/abstract
https://www.arxiv.org/abs/1605.09071
https://128.84.21.199/abs/1605.09071
https://tocbeta.cs.uchicago.edu/articles/v014a005/
https://arxiv.org/abs/1605.09071
https://dblp.uni-trier.de/db/journals/corr/corr1605.html#Ben-DavidK16
https://tocmirror.cs.uchicago.edu/articles/v014a005/
https://arxiv.org/pdf/1605.09071
http://mirror.cse.iitk.ac.in/toc/articles/v014a005/index.html
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.60

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions

Autoři: Ben-David, Shalev Blais, Eric

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Quantum Physics, 0202 electrical engineering, electronic engineering, information engineering, FOS: Physical sciences, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Quantum Physics (quant-ph), 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2002.10809

An Optimal Separation of Randomized and Quantum Query Complexity

Autoři: Sherstov, Alexander A. Storozhenko, Andrey A. Wu, Pei

Témata: Computer Science - Computational Complexity, Quantum Physics, text

URL: http://arxiv.org/abs/2008.10223

The zero-error randomized query complexity of the pointer function

Autoři: Radhakrishnan, Jaikumar Sanyal, Swagato Jaikumar Radhakrishnan and Swagato Sanyal

Přispěvatelé: Radhakrishnan, Jaikumar Sanyal, Swagato Jaikumar Radhakrishnan and Swagato Sanyal

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Query Complexity, 4. Education, Models of Computation, 0102 computer and information sciences, ddc:004, Deterministic Decision Tree, Computational Complexity (cs.CC), Randomized Decision Tree, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1607.01684
https://dblp.uni-trier.de/db/journals/corr/corr1607.html#RadhakrishnanS16
http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2016.html#RadhakrishnanS16
https://drops.dagstuhl.de/opus/volltexte/2016/6851/
https://arxiv.org/pdf/1607.01684
https://arxiv.org/abs/1607.01684
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.16