Aris Pagourtzis

1. Characterizations and approximability of hard counting classes below #P
   2020/03/05 by Eleni Bakali, Aggeliki Chalki, Bakali, Eleni +3 · 2 citations
   Computer Science · Mathematics · #Bayesian Modeling and Causal Inference #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods
2. Faster Algorithms for k-Subset Sum and Variations
   2021/12/08 by Antonis Antonopoulos, Aris Pagourtzis, Antonopoulos, Antonis +5 · 1 citation
   Computer Science · #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms
3. Satisfactory Budget Division
   2025/02/01 by Laurent Gourvès, Michael Lampis, Gourvès, Laurent +5 · 1 citation
   Economics, Econometrics and Finance · Decision Sciences · Computer Science · #Game Theory and Voting Systems #Auction Theory and Applications #Logic, Reasoning, and Knowledge