Pages that link to "Item:Q5711559"
From MaRDI portal
The following pages link to SOFSEM 2005: Theory and Practice of Computer Science (Q5711559):
Displaying 15 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
- Boolean functions: degree and support (Q1616170) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Robust polynomials and quantum algorithms (Q2643136) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← links)
- Computing Boolean Functions via Quantum Hashing (Q2944885) (← links)
- Optimal quantum query bounds for almost all Boolean functions. (Q2957905) (← links)
- Quantum Query Complexity of Boolean Functions with Small On-Sets (Q3597889) (← links)
- Boolean Functions, Projection Operators, and Quantum Error Correcting Codes (Q3604515) (← links)
- Algorithms for quantum branching programs based on fingerprinting (Q5146647) (← links)
- (Q5417637) (← links)
- STACS 2005 (Q5710710) (← links)