The following pages link to Sophie Laplante (Q230564):
Displayed 26 items.
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- On coherence, random-self-reducibility, and self-correction (Q1272663) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- The quantum adversary method and classical formula size power bounds (Q2458941) (← links)
- Circuit lower bounds à la Kolmogorov (Q2508341) (← links)
- Resource-Bounded Kolmogorov Complexity Revisited (Q2784486) (← links)
- Classical and Quantum Partition Bound and Detector Inefficiency (Q2843287) (← links)
- (Q2920130) (← links)
- (Q3104217) (← links)
- (Q3171624) (← links)
- The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
- Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
- Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments (Q3614148) (← links)
- Kolmogorov Complexity and Combinatorial Methods in Communication Complexity (Q3630211) (← links)
- (Q4035674) (← links)
- (Q4381383) (← links)
- (Q4637977) (← links)
- Relative Discrepancy Does Not Separate Information and Communication Complexity (Q4973867) (← links)
- (Q5089234) (← links)
- Merkle Puzzles in a Quantum World (Q5199203) (← links)
- Probabilistic abstraction for model checking (Q5277785) (← links)
- (Q5278346) (← links)
- Logical Approaches to Computational Barriers (Q5898828) (← links)
- Quantum Kolmogorov complexity (Q5956011) (← links)
- The communication complexity of functions with large outputs (Q6148077) (← links)