3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing

      , ,
      SIAM Journal on Computing
      Society for Industrial & Applied Mathematics (SIAM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references27

          • Record: found
          • Abstract: not found
          • Article: not found

          Property testing and its connection to learning and approximation

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On extremal problems of graphs and generalized graphs

            P Erdös (1964)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The counting lemma for regulark-uniform hypergraphs

                Bookmark

                Author and article information

                Journal
                SIAM Journal on Computing
                SIAM J. Comput.
                Society for Industrial & Applied Mathematics (SIAM)
                0097-5397
                1095-7111
                January 2016
                January 2016
                : 45
                : 6
                : 2199-2223
                Article
                10.1137/15M1007355
                bb369a1c-7138-4ced-9dec-b457a7266d64
                © 2016
                History

                Comments

                Comment on this article