Miklós - PDFSEARCH.IO - Document Search Engine

Miklós
Results: 394

#	Item
61	The complexity of approximate Nash equilibrium in congestion games with negative delays ? Fr´ed´eric Magniez1 , Michel de Rougemont1,2 , Miklos Santha1,3 , and Xavier Zeitoun1,4 1 Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2011-12-25 07:50:35
62	Semantical Counting Circuits Fabrice Noilhan† ∗ Miklos Santha‡ Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2010-12-13 11:02:50
63	Wielkie Bitwy Rewolucji Amerykańskiej Autor gry: Mark Miklos 1. WPROWADZENIE Add to Reading List Source URL: www.gmtgames.com Language: Polish - Date: 2015-10-03 09:24:16
64	Dossier de presse Miklós Jancsó RÉTROSPECTIVE 28 octobre – 30 novembre 2015 Add to Reading List Source URL: www.cinematheque.fr Language: French - Date: 2015-08-17 08:25:27
65	Quantum walk based search algorithms ? Miklos Santha1,2 1 Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2010-12-13 11:02:50
66	On the black-box complexity of Sperner’s Lemma ∗ Katalin Friedl† G´abor Ivanyos‡ Miklos Santha Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2010-12-13 11:02:50
67	Nonlocality and conflicting interest games Anna Pappa,1, 2 Niraj Kumar,3 Thomas Lawson,1 Miklos Santha,2, 4 Shengyu Zhang,5 Eleni Diamanti,1 and Iordanis Kerenidis2, 4 1 LTCI, CNRS – T´el´ecom ParisTech, Paris, Fran Add to Reading List Source URL: xxx.lanl.gov Language: English - Date: 2015-01-19 00:18:51
68	Diversi…cation through Trade Francesco Caselliy;[ Miklos Korenz Milan Lisickyx Add to Reading List Source URL: www.centreformacroeconomics.ac.uk Language: English - Date: 2015-08-25 09:08:53
69	Quantum and Classical Query Complexities of Local Search are Polynomially Related Miklos Santha∗ Mario Szegedy† Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2010-12-13 11:02:51
70	Locally 2-dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes ! Katalin Friedl1 , G´abor Ivanyos2 , Miklos Santha3 , and Yves F. Verhoeven3,4 1 Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2010-12-13 11:02:49

UPDATE