Adam Bouland
theory.stanford.edu
With Itai Arad, Daniel Grier, Miklos Santha, Aarthi Sundaram and Shengyu Zhang. In Proc. MFCS '16. [arXiv, MFCS, PDF]; Complexity classification of two-qubit ...
Algorithms and Complexity: 4th Italian Conference, CIAC Rome,...
books.google.de
Semantical Counting Circuits" Fabrice Noilhan' and Miklos Santha" ' Université Paris-Sud, LRI, Bat. 490, Orsay, France Fabrice. Noilhan (Qlri. fr * CNRS, ...
Fundamentals of Com…tion Theory: 15th International ...books.google.cz › books
books.google.cz
... of TFNP, the family Query Complexity On the Black-Box Complexity of Sperner's Lemma Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F Verhoeven.
[ ] Separations in Query Complexity Based on Pointer...
arxiv.org
Authors:Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs. (Submitted on 15 Jun (v1), last revised 26 Oct ...
Search results for "Com…tional Complexity Conference" – FacetedDBLP
dblp.l3s.uni-hannover.de
Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang: On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz.
Query Complexity of Matroids | SpringerLink
link.springer.com
Let $\mathcal{M}$ be a bridgeless matroid on ground set {1,...,n} and...
Improved Bounds for the Randomized Decision Tree Complexity of...
www.ias.edu
This is joint work with Frederic Magniez, Miklos Santha, and David Xiao. Tags: Computer Science and Discrete Mathematics (CSDM).
Alle Infos zum Namen "Miklos Santha"
Miklos Santha - Google Scholar
scholar.google.com
Senior researcher in Computer Science, CNRS Paris and CQT Singapore - lần trích dẫn - Algorithms - complexity - randomness - quantum...
au:Santha_M in:cs - SciRate Search
scirate.com
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean ...
4th FILOFOCS 2015
hyde.eng.tau.ac.il
Miklos Santha - On the complexity of trial and error for constraint satisfaction problems. 12: :30, Irit Dinur - Old and new PCP constructions. 12: :
DROPS - A Composition Theorem for Randomized Query Complexity via...
drops.dagstuhl.de
@InProceedings{gavinsky_et_al:LIPIcs:2019:10640, author = {Dmitry Gavinsky and Troy Lee and Miklos Santha and Swagato Sanyal}, title = {{A Composition ...
Alexander Belov
home.lu.lv
Aleksandrs Belovs, Gabor Ivanyos, Youming Qiao, Miklos Santha, and Siyi Yang On the polynomial parity argument complexity of the combinatorial ...
Ashwin Nayak: Publications
www.math.uwaterloo.ca
Frédéric Magniez, Ashwin Nayak, Miklos Santha, and David Xiao. Improved Bounds for the Randomized Decision Tree Complexity of ...
Improved bounds for the randomized decision tree complexity of...
hal.archives-ouvertes.fr
Frédéric Magniez 1 Ashwin Nayak 2Miklos Santha 1 David Xiao 1. Détails. 1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications.
On the Polynomial Parity Argument Complexity of DROPSdrops.dagstuhl.de › opus › volltexte
drops.dagstuhl.de
@InProceedings{belovs_et_al:LIPIcs:2017:7526, author = {Aleksandrs Belovs and G{\'a}bor Ivanyos and Youming Qiao and Miklos Santha and Siyi Yang}, title ...
Quantum Testers for Hidden Group Properties - IOS Press
content.iospress.com
We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their...
cc.complexity theory - How can one find the "hard" probability...
cstheory.stackexchange.com
[3] Frédéric Magniez, Ashwin Nayak, Miklos Santha, and David Xiao. Improved bounds for the randomized decision tree complexity of recursive majority. In Luca ...
Verwandte Suchanfragen zu Miklos Santha
| Frederic Magniez Eleni Diamanti Anna Pappa | Natasha Tews |
Personen Vorname "Miklos" (316) Name "Santha" (6) |
sortiert nach Relevanz / Datum