Andrzej Lingas
1 – 10 of 118
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
- Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
-
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
Gasieniec, Leszek ; Jansson, Jesper LU ; Levcopoulos, Christos LU
; Lingas, Andrzej
LU
and Persson, Mia
LU
(2021)
In Journal of Computer and System Sciences
118.
p.108-118
Mark
-
Online and Approximate Network Construction from Bounded Connectivity Constraints
Jansson, Jesper LU ; Levcopoulos, Christos LU
and Lingas, Andrzej
LU
(2021)
12th International Conference on Algorithms and Complexity (CIAC 2021)
In Lecture Notes in Computer science
12701.
p.314-325
Mark
- 2020
- Computing the boolean product of two n × n boolean matrices using o(N2) mechanical operations
- Graphs with equal domination and covering numbers
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
- A simple approach to nondecreasing paths
- Solving Hard Problems by Protein Folding?
- 2019
- Lower bounds for Demorgan circuits of bounded negation width
- Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs