| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Zamaraeva, Elena | en_US |
| dc.contributor.author | Žunić, Joviša | en_US |
| dc.date.accessioned | 2025-03-27T13:18:53Z | - |
| dc.date.available | 2025-03-27T13:18:53Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/5508 | - |
| dc.description.abstract | A {0,1}-valued function on a two-dimensional rectangular grid is called threshold if its sets of zeros and ones are separable by a straight line. In this paper we study 2-threshold functions, i.e. functions representable as the conjunction of two threshold functions. We provide a characterization of 2-threshold functions by pairs of oriented prime segments, where each such segment is defined by an ordered pair of adjacent integer points. | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.ispartof | Theoretical Computer Science | en_US |
| dc.subject | Essential point | Integer lattice | Intersection of halfplanes | k-Threshold function | Rectangular grid | Threshold function | en_US |
| dc.title | A characterization of 2-threshold functions via pairs of prime segments | en_US |
| dc.type | Article | en_US |
| dc.identifier.doi | 10.1016/j.tcs.2022.03.025 | - |
| dc.identifier.scopus | 2-s2.0-85127744375 | - |
| dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | en_US |
| dc.relation.firstpage | 1 | - |
| dc.relation.lastpage | 17 | - |
| dc.relation.volume | 919 | - |
| dc.description.rank | M23 | - |
| item.cerifentitytype | Publications | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.fulltext | No Fulltext | - |
| item.openairetype | Article | - |
| item.grantfulltext | none | - |
| crisitem.author.orcid | 0000-0002-1271-4153 | - |
SCOPUSTM
Citations
1
checked on Nov 26, 2025
Page view(s)
51
checked on Nov 26, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.