„randomized complexity“

Suchergebnisse

139 Treffer

• A Note on the Advice Complexity of Multipass Randomized Logspace
  Dixon, Peter ; Mandal, Debasis ; Pavan, A. ; Vinodchandran, N. V. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
  Kratsch, Stefan 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Randomized Query Complexity of Sabotaged and Composed Functions
  Shalev, Ben-David ; Kothari, Robin 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Limits of Minimum Circuit Size Problem as Oracle
  Hirahara, Shuichi ; Watanabe, Osamu 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Randomized Polynomial Kernel for Subset Feedback Vertex Set
  Hols, Eva-Maria C. ; Kratsch, Stefan 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Better Separation between Deterministic and Randomized Query Complexity
  Mukhopadhyay, Sagnik ; Sanyal, Swagato 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Separating Decision Tree Complexity from Subcube Partition Complexity
  Kothari, Robin ; Racicot-Desloges, David ; Santha, Miklos 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Randomized Communication Complexity for Linear Algebra Problems over Finite Fields
  Sun, Xiaoming ; Wang, Chengu 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Everywhere complex sequences and the probabilistic method
  Rumyantsev, Andrey Yu. 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
  Hirsch, Edward A. ; Itsykson, Dmitry 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
  Cheraghchi, Mahdi ; Shokrollahi, Amin 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Algorithm for Mean-Payoff Games
  Chaloupka, Jakub ; Brim, Luboš 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431)
  Doerr, Carola ; Fonseca, Carlos M. ; Friedrich, Tobias ; Yao, Xin
• Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 17191)
  Doerr, Carola ; Igel, Christian ; Thiele, Lothar ; Yao, Xin
• Coding Theory in the Time of Big Data (Dagstuhl Seminar 16321)
  Bossert, Martin ; Byrne, Eimear ; Soljanin, Emina
• Coding Theory (Dagstuhl Seminar 11461)
  Rosenthal, Joachim ; Shokrollahi, M. Amin ; Walker, Judy L.
• Analysis and Efficiency of Randomized Optimization Heuristics
  Lässig, Jörg
• Algorithms and Discrete Applied Mathematics – First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings
  2015 Springer International Publishing
• Approximation and online algorithms – 8th international workshop ; revised papers
  Jansen, Klaus ; Solis-Oba, Roberto 2011 Springer
• Randomized Online Computation with High Probability Guarantees
  Komm, Dennis ; Královič, Rastislav ; Královič, Richard ; Mömke, Tobias