Vladimir Podolskii

activity

20232026

most citedLogical Languages Accepted by Transformer Encoders with Hard Attention

2 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.FL2024★ 1 cited

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$ -Partitions

Vladimir Podolskii, Victor Selivanov

It is known that the Wadge reducibility of regular $ω$ -languages is efficiently decidable (Krishnan et al., 1995), (Wilke, Yoo, 1995). In this paper we study analogous problem for…

cs.CC2024

Nearest Neighbor Complexity and Boolean Circuits

Mason DiCicco, Vladimir Podolskii, Daniel Reichman

A nearest neighbor representation of a Boolean function $f$ is a set of vectors (anchors) labeled by $0$ or $1$ such that $f (x) = 1$ if and only if the closest anchor to $\ve…

Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions

Nearest Neighbor Complexity and Boolean Circuits

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$ -Partitions