Parity problem

Results: 27



#Item
1Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-07-03 07:48:38
2Parity Solution to Strong CP and Its Implications R. N. Mohapatra Fermilab Seminar, 2016 Plan of the talk

Parity Solution to Strong CP and Its Implications R. N. Mohapatra Fermilab Seminar, 2016 Plan of the talk

Add to Reading List

Source URL: theory.fnal.gov

Language: English - Date: 2016-04-09 13:10:19
3On Noise-Tolerant Learning of Sparse Parities and Related Problems Elena Grigorescu? , Lev Reyzin?? , and Santosh Vempala? ? ? School of Computer Science Georgia Institute of Technology 266 Ferst Drive, Atlanta GA 30332

On Noise-Tolerant Learning of Sparse Parities and Related Problems Elena Grigorescu? , Lev Reyzin?? , and Santosh Vempala? ? ? School of Computer Science Georgia Institute of Technology 266 Ferst Drive, Atlanta GA 30332

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2011-07-12 15:23:57
4The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem ? (Extended Abstract) Vadim Lyubashevsky University of California at San Diego, La Jolla CA 92093, USA

The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem ? (Extended Abstract) Vadim Lyubashevsky University of California at San Diego, La Jolla CA 92093, USA

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2010-09-13 15:36:39
    5Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model AVRIM BLUM, ADAM KALAI, AND HAL WASSERMAN Carnegie Mellon University, Pittsburgh, Pennsylvania Abstract. We describe a slightly subexponential

    Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model AVRIM BLUM, ADAM KALAI, AND HAL WASSERMAN Carnegie Mellon University, Pittsburgh, Pennsylvania Abstract. We describe a slightly subexponential

    Add to Reading List

    Source URL: research.microsoft.com

    Language: English - Date: 2011-03-02 19:24:24
    6Displaced Supersymmetry Prashant Saraswat arXiv:with Peter Graham, David E. Kaplan and Surjeet Rajendran

    Displaced Supersymmetry Prashant Saraswat arXiv:with Peter Graham, David E. Kaplan and Surjeet Rajendran

    Add to Reading List

    Source URL: theory.fnal.gov

    Language: English - Date: 2015-04-03 15:20:39
    7Homework 3 Problem 1: Present a polynomial time algorithm for graphs (only one player) with parity objectives, and present the running time of your algorithm in terms of n,m, and d, where n is the number of states, m is

    Homework 3 Problem 1: Present a polynomial time algorithm for graphs (only one player) with parity objectives, and present the running time of your algorithm in terms of n,m, and d, where n is the number of states, m is

    Add to Reading List

    Source URL: pub.ist.ac.at

    - Date: 2010-04-28 09:52:07
      8In search of a better code •! Problem: information about a particular message unit (bit, byte, ..) is captured in just a few locations, i.e., the message unit and some number of parity units. So a small but unfortunate

      In search of a better code •! Problem: information about a particular message unit (bit, byte, ..) is captured in just a few locations, i.e., the message unit and some number of parity units. So a small but unfortunate

      Add to Reading List

      Source URL: web.mit.edu

      Language: English - Date: 2009-03-04 09:36:52
        9A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†

        A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†

        Add to Reading List

        Source URL: files.oliverfriedmann.de

        Language: English - Date: 2012-02-10 07:43:15
        10Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str

        Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str

        Add to Reading List

        Source URL: www.nada.kth.se

        Language: English - Date: 2011-01-05 06:16:54