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

Cites Work

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

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)