On the computational complexity of malpractices in liquid democracy

Komarath, BalagopalMore, Yash HirenYash HirenMore2025-09-042025-09-042024-01-01http://repository.iitgn.ac.in/handle/IITG2025/32004hbk.; 30 cmMinimum Budget-Computational Complexity-ElectionPolynomial-Time AlgorithmPolynomial-Time Dynamic Programming AlgorithmOn the computational complexity of malpractices in liquid democracyM.Techxi, 31p.M.Tech123456789/440