Egor Ianovski : Publications
Journal papers
-
[1]
COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
EGOR IANOVSKI‚ RUSSELL MILLER‚ KENG MENG NG and ANDRÉ NIES
In The Journal of Symbolic Logic. Vol. 79. Pages 859–881. September, 2014.
Details about COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY | BibTeX data for COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY | DOI (10.1017/jsl.2013.33) | Link to COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
Conference papers
-
[1]
∃GuaranteeNash for Boolean games is NEXP−hard
Egor Ianovski and Luke Ong
In 14th International Conference on Principles of Knowledge Representation and Reasoning. 2014.
Details about ∃GuaranteeNash for Boolean games is NEXP−hard | BibTeX data for ∃GuaranteeNash for Boolean games is NEXP−hard
-
[2]
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
Alwen Tiu‚ Egor Ianovski and Rajeev Goré
In Advances in Modal Logic. Pages 516−537. 2012.
Details about Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures | BibTeX data for Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
-
[3]
The Complexity of Safe Manipulation under Scoring Rules
Egor Ianovski‚ Lan Yu‚ Edith Elkind and Mark C. Wilson
In IJCAI. Pages 246−251. 2011.
Details about The Complexity of Safe Manipulation under Scoring Rules | BibTeX data for The Complexity of Safe Manipulation under Scoring Rules