Searching for authors named "Miklos Santha" – sorted by Relevance.
-
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae
- On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae Miklos Santha CNRS
- Cited by 5 (0 self) – Add To MetaCart
-
Quantum walk based search algorithms
- Quantum walk based search algorithms ⋆ Miklos Santha 1,2 1 CNRS–LRI, Université Paris–Sud, 91405
- Cited by 1 (1 self) – Add To MetaCart
-
Semantical Counting Circuits
- Semantical Counting Circuits ? Fabrice Noilhan 1 and Miklos Santha 2 1 Universit'e Paris
- Cited by 1 (0 self) – Add To MetaCart
-
On the Reversibility of Oblivious Transfer
- On the Reversibility of Oblivious Transfer Claude Cr'epeau y Mikl'os S'antha z Laboratoire de
- Cited by 30 (8 self) – Add To MetaCart
-
Verifying The Determinant In Parallel
- VERIFYING THE DETERMINANT IN PARALLEL Miklos Santha and Sovanna Tan Abstract. In this paper we
- Cited by 4 (1 self) – Add To MetaCart
-
Efficient Reduction among Oblivious Transfer Protocols based on New Self-Intersecting Codes
- Cr'epeau Mikl'os S'antha y Laboratoire de Recherche en Informatique Universit'e Paris
- Cited by 6 (5 self) – Add To MetaCart
-
Quantum and classical query complexities of local search are polynomially related
- Quantum and Classical Query Complexities of Local Search are Polynomially Related Miklos Santha
- Cited by 12 (2 self) – Add To MetaCart
-
A Decision Procedure For Unitary Linear Quantum Cellular Automata
- automata Christoph Durr y Miklos Santha z Abstract Linear quantum cellular automata were introduced
- Cited by 7 (1 self) – Add To MetaCart
-
Self-testing of universal and fault-tolerant sets of quantum gates
- † Michele Mosca ‡ Miklos Santha § Abstract We consider the design of self-testers for quantum gates. A self
- Cited by 4 (3 self) – Add To MetaCart
-
Quantum testers for hidden group properties
- Santha 2 , and Pranab Sen 2 1 CAI, Hungarian Academy of Sciences, H-1111 Budapest, Hungary, 2 CNRS
- Cited by 4 (1 self) – Add To MetaCart

