Author:
Borges Nerio,Camacho Franklin,Risco-Iturralde Paul
Reference12 articles.
1. Computational Complexity
2. Universal First-Order Logic is Superfluous for NL, P, NP and coNP;Nerio Borges;Logical Methods in Computer Science,2014
3. Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy;Nerio Borges;Logic Journal of the IGPL,2019
4. Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity;S Bouveret;Journal of Artificial Intelligence Research,2008
5. Reasoning about Social Choice and Games in Monadic Fixed-Point Logic;Ramit Das;Electronic Proceedings in Theoretical Computer Science,2019