No label defined (Q4638079)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6866319

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 6866319

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

10.4230/LIPIcs.ITCS.2017.29

0 references

Clément L. Canonne

0 references

Elena Grigorescu

0 references

0 references

0 references

0 references

publication date

3 May 2018

0 references

full work available at URL

https://arxiv.org/abs/1609.00265

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Boolean functions

0 references

learning

0 references

monotonicity

0 references

property testing

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Information theory in property testing and monotonicity testing in higher dimension

0 references

A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates

0 references

Learning regular sets from queries and counterexamples

0 references

Fast approximate PCPs for multidimensional bin-packing problems

0 references

A polynomial lower bound for testing monotonicity

0 references

L <sub>p</sub> -testing

0 references

Property testing lower bounds via communication complexity

0 references

Learning circuits with few negations

0 references

Monotonicity testing and shortest-path routing on the cube

0 references

On the Fourier spectrum of monotone functions

0 references

0 references

Testing Probability Distributions Underlying Aggregated Data

0 references

A o(n) monotonicity tester for boolean functions over the hypercube

0 references

Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids

0 references

0 references

An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube

0 references

Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries

0 references

0 references

0 references

Approximating the distance to monotonicity in high dimensions

0 references

On the strength of comparisons in property testing

0 references

Monotonicity testing over general poset domains

0 references

Testing monotonicity

0 references

Negation-Limited Formulas.

0 references

The Power of Negations in Cryptography

0 references

Testing monotonicity over graph products

0 references

Boolean function complexity. Advances and frontiers.

0 references

Agnostically Learning Halfspaces

0 references

Testing problems with sublearning sample complexity

0 references

Cryptographic limitations on learning Boolean formulae and finite automata

0 references

On Monotonicity Testing and Boolean Isoperimetric-type Theorems

0 references

Testing Surface Area

0 references

Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers

0 references

0 references

On the Inversion Complexity of a System of Functions

0 references

Testing surface area with arbitrary accuracy

0 references

Analysis of Boolean Functions

0 references

Learning Monotone Decision Trees in Polynomial Time

0 references

KKL, Kruskal-Katona, and Monotone Nets

0 references

Tolerant property testing and distance approximation

0 references

Monotone circuits for matching require linear depth

0 references

0 references

On learning monotone DNF under product distributions

0 references

A theory of the learnable

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4638079

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4638079&oldid=36389024"