activity
20212024
most citedQuality versus speed in energy demand prediction for district heating systems

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

collaborators
Showing cs.CCShow all

1 paper · 1 filter

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.…