A characterization of 2-threshold functions via pairs of prime segments

Recommendations

On the number of two-dimensional threshold functions
Asymptotics of the number of 2-threshold functions
Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
On teaching sets for 2-threshold functions of two variables
On the minimal teaching sets of two-dimensional threshold functions

Cites work

scientific article; zbMATH DE number 1301786 (Why is no real title available?)
A General Coding Scheme for Families of Digital Curve Segments
About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
Algorithms and lower bounds for on-line learning of geometrical concepts
Asymptotics of the number of 2-threshold functions
Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
Bilinear separation of two sets in \(n\)-space
Classification by polynomial surfaces
Computing Boolean functions by polynomials and threshold circuits
Cutting corners with spheres in \(d\)-dimensions
Different digitisations of displaced discs
Efficiently testing digital convexity and recognizing digital convex polygons
Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic
Fast identification of geometric objects with membership queries
Harmonic Analysis of Polynomial Threshold Functions
Learning intersections and thresholds of halfspaces
Linear read-once and related Boolean functions
Minimum polygonal separation
On specifying Boolean functions by labelled examples
On teaching sets for 2-threshold functions of two variables
On teaching sets of \(k\)-threshold functions
On the complexity of deciphering the threshold functions of \(k\)-valued logic
On the complexity of polyhedral separability
On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
On the minimal teaching sets of two-dimensional threshold functions
On the number of digital convex polygons inscribed into an (m,m)-grid
On the number of linear partitions of the \((m,n)\)-grid
PAC learning intersections of halfspaces with membership queries
Polyhedral separability through successive LP
Polynomial threshold functions and Boolean threshold circuits
Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3
Specifying a positive threshold function via extremal points
Support vector machine polyhedral separability in semisupervised learning
The number of configurations in lattice point counting. II
The number of digital straight lines on an N*N grid

Cited in

(2)

On Boolean threshold functions with minimum specification number
A characterization of 2-threshold functions via pairs of prime segments

This page was built for publication: A characterization of 2-threshold functions via pairs of prime segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136278)