-
1Conference
Contributors: Sourav Chakraborty and Anna Gál and Sophie Laplante and Rajat Mittal and Anupa Sunny, Magniez, Frédéric
Subject Terms: certificate complexity, zero-communication two-player games, boolean function complexity, block sensitivity, Theory of computation → Quantum query complexity, query complexity, [INFO] Computer Science [cs], ddc:004, sensitivity, Theory of computation → Computational complexity and cryptography, Theory of computation → Circuit complexity
File Description: application/pdf
-
2Conference
Authors: Apers, Simon, Magniez, Frédéric, Sen, Sayantan, Szabó, Dániel
Contributors: Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Université Paris Cité (UPCité)
Source: 29th International Conference on Randomization and Computation
https://hal.science/hal-05343010
29th International Conference on Randomization and Computation, Aug 2025, Berkeley, United States. ⟨10.4230/LIPIcs.APPROX/RANDOM.2025.32⟩Subject Terms: Theory of computation → Quantum query complexity, sublinear and near linear time algorithms, Theory of computation → Streaming, collision finding, dual polynomial method, bounded-degree directed graphs, quantum computing, property testing, [INFO]Computer Science [cs]
Subject Geographic: Berkeley, United States
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2410.05001; ARXIV: 2410.05001
-
3Academic Journal
Authors: Apers, Simon, Lee, Troy
Contributors: Apers, Simon, Simon Apers and Troy Lee
Subject Terms: FOS: Computer and information sciences, Quantum algorithms, Quantum Physics, Mathematics of computing → Graph algorithms, quantum query complexity, Minimum cut, FOS: Physical sciences, Généralités, 0102 computer and information sciences, Theory of computation → Quantum complexity theory, 01 natural sciences, minimum cut, Quantum query complexity, Computer Science - Data Structures and Algorithms, Theory of computation → Quantum query complexity, Data Structures and Algorithms (cs.DS), ddc:004, Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]
File Description: application/pdf; No full-text files
Access URL: http://arxiv.org/abs/2011.09823
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A31117
https://drops.dagstuhl.de/opus/volltexte/2021/14302/pdf/LIPIcs-CCC-2021-28.pdf/
https://dblp.uni-trier.de/db/conf/coco/coco2021.html#ApersL21
https://ir.cwi.nl/pub/31117
https://drops.dagstuhl.de/opus/volltexte/2021/14302/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.28 -
4Conference
Authors: Apers, Simon, Lee, Troy
Contributors: Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)
Source: CCC '21: Proceedings of the 36th Computational Complexity Conference ; https://hal.science/hal-04239951 ; CCC '21: Proceedings of the 36th Computational Complexity Conference, Jul 2021, Toronto, Canada. ⟨10.4230/LIPIcs.CCC.2021.28⟩
Subject Terms: Quantum algorithms, quantum query complexity, minimum cut, Theory of computation → Quantum query complexity, Mathematics of computing → Graph algorithms, Theory of computation → Quantum complexity theory, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]
Subject Geographic: Toronto
Time: Toronto, Canada
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2011.09823; ARXIV: 2011.09823