Sensitivity of -ary functions and low degree partitions of Hamming graphs
S Asensio, I García-Marco, K Knauer - arXiv preprint arXiv:2409.16141, 2024 - arxiv.org
The study of complexity measures of Boolean functions led Nisan and Szegedy to state the
sensitivity conjecture in 1994, claiming a polynomial relation between degree and …
sensitivity conjecture in 1994, claiming a polynomial relation between degree and …
Deep Neural Network-Based Accelerators for Repetitive Boolean Logic Evaluation
D Senarathna, S Tragoudas - 2023 IEEE 36th International …, 2023 - ieeexplore.ieee.org
This paper shows the learnability of complex Boolean Logic functions by Deep Neural
Networks (DNNs) and the ability to accelerate logic evaluation using DNNs while ensuring …
Networks (DNNs) and the ability to accelerate logic evaluation using DNNs while ensuring …
System Analysis With Signal Temporal Logic: Monitoring, Motion Planning, and Data Mining
R Yan - 2023 - search.proquest.com
This dissertation is about the analysis of systems using temporal logics, focusing on three
perspectives: temporal logic monitoring, motion planning with temporal logic specifications …
perspectives: temporal logic monitoring, motion planning with temporal logic specifications …