The following pages link to Ronald de Wolf (Q835642):
Displayed 50 items.
- Item:Q835642 (redirect page) (← links)
- Item:Q835642 (redirect page) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Quantum zero-error algorithms cannot be composed (Q1014398) (← links)
- Foundations of inductive logic programming (Q1356228) (← links)
- A lower bound for quantum search of an ordered list (Q1606939) (← links)
- Attacks on the AJPS Mersenne based cryptosystem (Q1644753) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Quantum symmetrically-private information retrieval (Q2390235) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Robust polynomials and quantum algorithms (Q2643136) (← links)
- Average-case quantum query complexity (Q2766189) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Error-Correcting Data Structures (Q2839172) (← links)
- (Q2908845) (← links)
- Bounded-error quantum state identification and exponential separations in communication complexity (Q2931421) (← links)
- A new quantum lower bound method, (Q2931423) (← links)
- (Q2957488) (← links)
- (Q2957903) (← links)
- (Q2957905) (← links)
- Bell Inequalities: What Do We Know about Them and Why Should Cryptographers Care? (Q3002107) (← links)
- (Q3113749) (← links)
- (Q3171599) (← links)
- (Q3171708) (← links)
- (Q3191566) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (Q3521970) (← links)
- Better Gap-Hamming Lower Bounds via Better Round Elimination (Q3588428) (← links)
- (Q3604066) (← links)
- Lower Bounds on Matrix Rigidity Via a Quantum Argument (Q3613749) (← links)
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography (Q3642860) (← links)
- (Q4251052) (← links)
- (Q4386949) (← links)
- (Q4449183) (← links)
- (Q4501528) (← links)
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing (Q4575644) (← links)
- (Q4614114) (← links)
- Nondeterministic Quantum Query and Communication Complexities (Q4706225) (← links)
- (Q4736848) (← links)
- (Q4736853) (← links)
- Improved Bounds on Fourier Entropy and Min-entropy (Q5066141) (← links)
- (Q5091164) (← links)
- (Q5111155) (← links)
- Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity (Q5189538) (← links)
- Quantum Algorithms for Element Distinctness (Q5317198) (← links)
- (Q5368751) (← links)
- (Q5389979) (← links)