The following pages link to Miklos Santha (Q407593):
Displaying 50 items.
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- Improved quantum query algorithms for triangle detection and associativity testing (Q513275) (← links)
- Parallel searching of multidimensional cubes (Q685702) (← links)
- A new public-key cryptosystem via Mersenne numbers (Q775988) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Generating quasi-random sequences from semi-random sources (Q1088641) (← links)
- On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137) (← links)
- Relativized Arthur-Merlin versus Merlin-Arthur games (Q1117218) (← links)
- (Q1203119) (redirect page) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- Verifying the determinant in parallel (Q1272660) (← links)
- Average-case analysis of the merging algorithm of Hwang and Lin (Q1277377) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Semantical counting circuits (Q1405787) (← links)
- Efficient approximation algorithms for the subset-sums equality problem. (Q1608313) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Characterising the intersection of QMA and coQMA (Q2099640) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups (Q2428678) (← links)
- On the hitting times of quantum versus random walks (Q2429358) (← links)
- Total functions in QMA (Q2684235) (← links)
- (Q2743234) (← links)
- A Decision Procedure for Unitary Linear Quantum Cellular Automata (Q2784493) (← links)
- Improved bounds for the randomized decision tree Complexity of recursive majority (Q2811168) (← links)
- Approximate testing with relative error (Q2819533) (← links)
- (Q2913817) (← links)
- (Q2921783) (← links)
- An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group (Q2922610) (← links)
- New bounds on the classical and quantum communication complexity of some graph properties (Q2957488) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2965501) (← links)
- Search via Quantum Walk (Q2999859) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- Oblivious transfers and intersecting codes (Q3129464) (← links)
- Self-testing of universal and fault-tolerant sets of quantum gates (Q3192043) (← links)
- (Q3338230) (← links)
- Consecutive-2 systems on trees (Q3415858) (← links)
- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes (Q3434572) (← links)
- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields (Q3452558) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- (Q3549657) (← links)
- Hidden translation and orbit coset in quantum computing (Q3581285) (← links)
- Efficient testing of groups (Q3581388) (← links)
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups (Q3590968) (← links)
- Quantum Testers for Hidden Group Properties (Q3634002) (← links)
- (Q3705434) (← links)
- (Q3787473) (← links)
- (Q3956919) (← links)
