A characterization of 2-threshold functions via pairs of prime segments
From MaRDI portal
Publication:2136278
DOI10.1016/j.tcs.2022.03.025OpenAlexW3041595132WikidataQ114129125 ScholiaQ114129125MaRDI QIDQ2136278
Elena Zamaraeva, Joviša D. Žunić
Publication date: 10 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.03986
rectangular gridintersection of halfplanesthreshold functioninteger latticeessential point\(k\)-threshold function
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- On teaching sets of \(k\)-threshold functions
- Learning intersections and thresholds of halfspaces
- Minimum polygonal separation
- On the complexity of polyhedral separability
- On the number of linear partitions of the \((m,n)\)-grid
- PAC learning intersections of halfspaces with membership queries
- Computing Boolean functions by polynomials and threshold circuits
- Bilinear separation of two sets in \(n\)-space
- Algorithms and lower bounds for on-line learning of geometrical concepts
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
- On the complexity of deciphering the threshold functions of \(k\)-valued logic
- Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3
- Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
- Linear read-once and related Boolean functions
- Cutting corners with spheres in \(d\)-dimensions
- Fast identification of geometric objects with membership queries
- Classification by polynomial surfaces
- On specifying Boolean functions by labelled examples
- Asymptotics of the number of 2-threshold functions
- Efficiently testing digital convexity and recognizing digital convex polygons
- Support vector machine polyhedral separability in semisupervised learning
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- Different digitisations of displaced discs
- Polynomial threshold functions and Boolean threshold circuits
- The number of configurations in lattice point counting II
- On the Minimal Teaching Sets of Two-Dimensional Threshold Functions
- Harmonic Analysis of Polynomial Threshold Functions
- The number of digital straight lines on an N*N grid
- A General Coding Scheme for Families of Digital Curve Segments
- On the number of digital convex polygons inscribed into an (m,m)-grid
- Specifying a positive threshold function via extremal points
- On teaching sets for 2-threshold functions of two variables
- Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic
- Polyhedral separability through successive LP
