The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Markovian search games in heterogeneous spaces
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Complexity theory for operators in analysis
Proceedings of the forty-second ACM symposium on Theory of computing
A note on propositional proof complexity of some Ramsey-type statements
Archive for Mathematical Logic
On the complexity of the sperner lemma
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Recent developments in equilibria algorithms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Partial solutions with unique completion
Reasoning, Action and Interaction in AI Theories and Systems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Locally 2-dimensional sperner problems complete for the polynomial parity argument classes
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Complexity Theory for Operators in Analysis
ACM Transactions on Computation Theory (TOCT)
On the complexity of parity games
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Structural complexity of multiobjective NP search problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |