Filtrer vos résultats
- 16
- 1
- 8
- 7
- 1
- 1
- 16
- 1
- 1
- 4
- 6
- 1
- 1
- 1
- 1
- 1
- 1
- 17
- 13
- 12
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 17
- 5
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
17 résultats
|
|
triés par
|
Improved Quantum Query Algorithms for Triangle Detection and Associativity TestingAlgorithmica, 2017, 77, pp.459-486. ⟨10.1007/s00453-015-0084-9⟩
Article dans une revue
hal-03753536v1
|
|||
On Learning Linear Functions from Subset and Its Applications in Quantum Computing26th Annual European Symposium on Algorithms (ESA 2018), 2018, Helsinki, Finland
Communication dans un congrès
hal-02351299v1
|
|||
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), 2018, Liverpool, United Kingdom
Communication dans un congrès
hal-02351374v1
|
|||
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Patras, Greece
Communication dans un congrès
hal-02350840v1
|
|||
|
Linear-Time Algorithm for Quantum 2SATTheory of Computing Systems, 2018, 14 (1), pp.1-27. ⟨10.4086/toc.2018.v014a001⟩
Article dans une revue
hal-02350768v1
|
||
A New Public-Key Cryptosystem via Mersenne NumbersCrypto 2018, 2018, Santa-Barbara, United States. pp.459-482
Communication dans un congrès
hal-01960756v1
|
|||
Verifying the Determinant in ParallelComputational Complexity, 1998, 7 (2), pp.128--151. ⟨10.1007/PL00001596⟩
Article dans une revue
istex
hal-01791246v1
|
|||
Verifying the Determinant in ParallelAlgorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, 1994, Unknown, Unknown Region. pp.65--73, ⟨10.1007/3-540-58325-4_167⟩
Communication dans un congrès
istex
hal-01791247v1
|
|||
Strategies for Quantum Races10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019, Seattle, United States
Communication dans un congrès
hal-02350866v1
|
|||
|
Discrete logarithm and Diffie-Hellman problems in identity black-box groups2019
Pré-publication, Document de travail
hal-02350271v1
|
||
Nonlocality and conflicting interest gamesPhysical Review Letters, 2015, 114, pp.020401
Article dans une revue
hal-02287032v1
|
|||
|
Quantum and Classical Algorithms for Approximate Submodular Function MinimizationQuantum Information & Computation, 2019, 19 (15&16), pp.1325-1349
Article dans une revue
hal-02350737v1
|
||
|
Quadratically Tight Relations for Randomized Query ComplexityTheory of Computing Systems, 2020, 64, pp.101-119. ⟨10.1007/s00224-019-09935-x⟩
Article dans une revue
hal-02351409v1
|
||
|
Improved bounds for the randomized decision tree complexity of recursive majority[Research Report] xx. 2010
Rapport
hal-00580816v1
|
||
|
Polynomial Interpolation and Identity Testing from High Powers Over Finite FieldsAlgorithmica, 2018, 80 (2), pp.560-575. ⟨10.1007/s00453-016-0273-1⟩
Article dans une revue
hal-02350749v1
|
||
|
On the complexity of trial and error for constraint satisfaction problemsJournal of Computer and System Sciences, 2018, 92, pp.48-64. ⟨10.1016/j.jcss.2017.07.005⟩
Article dans une revue
hal-02350754v1
|
||
|
Separations in Communication Complexity Using Cheat Sheets and Information Complexity2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), Oct 2016, New Brunswick, United States. pp.555-564, ⟨10.1109/FOCS.2016.66⟩
Communication dans un congrès
hal-02350817v1
|