1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2024
On SAT information content, its polynomial-time solvability and fixed code algorithms
Maciej Drozdowski
The amount of information in satisfiability problem (SAT) is considered. SAT can be polynomial-time solvable when the solving algorithm holds an exponential amount of information.…
cs.LG2022★ 1 cited
Quality versus speed in energy demand prediction for district heating systems
Witold Andrzejewski, Jedrzej Potoniec, Maciej Drozdowski +3
In this paper, we consider energy demand prediction in district heating systems. Effective energy demand prediction is essential in combined heat power systems when offering electr…
cs.DM2021
Interaction Maxima in Distributed Systems
Thomas Robertazzi, Maciej Drozdowski
In this paper we study the maximum degree of interaction which may emerge in distributed systems. It is assumed that a distributed system is represented by a graph of nodes interac…