4 citations · 10 across the 24 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2023
Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits
Andrzej Lingas, Mia Persson
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the input variables and the Boolean constants. It is -multilinear if for each its…
cs.CC2020
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism
Andrzej Lingas
We present implications from the known conjectures like APSP, 3SUM and ETH in a form of a negated containment of a linear-time with a non-deterministic logarithmic-bit oracle in a…
cs.CC2009★ 4 cited
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
Piotr Berman, Marek Karpinski, Andrzej Lingas
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time e…