Recherche - Archive ouverte HAL

Documentation
Français (FR)

Anglais (EN)

18 résultats

	Pour les 18 documents Envoyer sur ORCID RSS ATOM Exporter BibTeX XML-TEI CSV RTF EndNote PDF HTML Export avancé	Page :	triés par Pertinence Auteur A→Z Auteur Z→A Titre A→Z Titre Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante

		On Learning Linear Functions from Subset and Its Applications in Quantum Computing Miklos Santha , Gabor Ivanyos , Anupam Prakash 26th Annual European Symposium on Algorithms (ESA 2018), 2018, Helsinki, Finland Communication dans un congrès hal-02351299v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing Frédéric Magniez , Troy Lee , Miklos Santha Algorithmica, 2017, 77, pp.459-486. ⟨10.1007/s00453-015-0084-9⟩ Article dans une revue hal-03753536v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2) Miklos Santha , Sevag Gharibian , Jamie Sikora , Aarthi Sundaram , Justin Yirka 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), 2018, Liverpool, United Kingdom Communication dans un congrès hal-02351374v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Discrete logarithm and Diffie-Hellman problems in identity black-box groups Gabor Ivanyos , Antoine Joux , Miklos Santha 2019 Pré-publication, Document de travail hal-02350271v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Verifying the Determinant in Parallel Miklos Santha , Sovanna Tan Computational Complexity, 1998, 7 (2), pp.128--151. ⟨10.1007/PL00001596⟩ Article dans une revue istex hal-01791246v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Verifying the Determinant in Parallel Miklos Santha , Sovanna Tan Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, 1994, Unknown, Unknown Region. pp.65--73, ⟨10.1007/3-540-58325-4_167⟩ Communication dans un congrès istex hal-01791247v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Strategies for Quantum Races Miklos Santha , Troy Lee , Maharshi Ray 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019, Seattle, United States Communication dans un congrès hal-02350866v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A New Public-Key Cryptosystem via Mersenne Numbers Divesh Aggarwal , Antoine Joux , Anupam Prakash , Miklos Santha Crypto 2018, 2018, Santa-Barbara, United States. pp.459-482 Communication dans un congrès hal-01960756v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity Miklos Santha , Dmitry Gavinsky , Troy Lee , Swagato Sanyal 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Patras, Greece Communication dans un congrès hal-02350840v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Linear-Time Algorithm for Quantum 2SAT Itai Arad , Miklos Santha , Aarthi Sundaram , Shengyu Zhang Theory of Computing Systems, 2018, 14 (1), pp.1-27. ⟨10.4086/toc.2018.v014a001⟩ Article dans une revue hal-02350768v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Nonlocality and conflicting interest games Anna Pappa , Niraj Kumar , Thomas Lawson , Miklos Santha , Shengyu Zhang , et al. Physical Review Letters, 2015, 114, pp.020401 Article dans une revue hal-02287032v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Quantum and Classical Algorithms for Approximate Submodular Function Minimization Yassine Hamoudi , Patrick Rebentrost , Ansis Rosmanis , Miklos Santha Quantum Information & Computation, 2019, 19 (15&16), pp.1325-1349 Article dans une revue hal-02350737v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Quadratically Tight Relations for Randomized Query Complexity Rahul Jain , Hartmut Klauck , Srijita Kundu , Troy Lee , Miklos Santha , et al. Theory of Computing Systems, 2020, 64, pp.101-119. ⟨10.1007/s00224-019-09935-x⟩ Article dans une revue hal-02351409v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Improved bounds for the randomized decision tree complexity of recursive majority Frédéric Magniez , Ashwin Nayak , Miklos Santha , David Xiao [Research Report] xx. 2010 Rapport hal-00580816v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields Gabor Ivanyos , Marek Karpinski , Miklos Santha , Nitin Saxena , Igor E. Shparlinski Algorithmica, 2018, 80 (2), pp.560-575. ⟨10.1007/s00453-016-0273-1⟩ Article dans une revue hal-02350749v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On the complexity of trial and error for constraint satisfaction problems Gabor Ivanyos , Raghav Kulkarni , Youming Qiao , Miklos Santha , Aarthi Sundaram Journal of Computer and System Sciences, 2018, 92, pp.48-64. ⟨10.1016/j.jcss.2017.07.005⟩ Article dans une revue hal-02350754v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Separations in Communication Complexity Using Cheat Sheets and Information Complexity Anurag Anshu , Aleksandrs Belovs , Shalev Ben-David , Mika Göös , Rahul Jain , et al. 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), Oct 2016, New Brunswick, United States. pp.555-564, ⟨10.1109/FOCS.2016.66⟩ Communication dans un congrès hal-02350817v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On the interactive complexity of graph reliability Jean-Marc Couveignes , Juan Francisco Diaz-Frias , Michel de Rougemont , Miklos Santha International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 1994, Madras, India. pp.12-23, ⟨10.1007/3-540-58715-2_110⟩ Communication dans un congrès istex hal-04526104v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More