The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Size-depth trade-offs for threshold circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the complexity of negation-limited Boolean networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Coherence in finite argument systems
Artificial Intelligence
On the Complexity of Boolean Functions Computed by Lazy Oracles
IEEE Transactions on Computers
Topics in the theory of DNA computing
Theoretical Computer Science - Natural computing
The Communication Complexity of the Universal Relation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the computational complexity of qualitative coalitional games
Artificial Intelligence
The complexity of contract negotiation
Artificial Intelligence
Multiagent resource allocation
The Knowledge Engineering Review
On the computational complexity of coalitional resource games
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
The complexity of deciding reachability properties of distributed negotiation schemes
Theoretical Computer Science
Tight bounds for the multiplicative complexity of symmetric functions
Theoretical Computer Science
Note: Comparison between parallel and serial dynamics of Boolean networks
Theoretical Computer Science
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The complexity of contract negotiation
Artificial Intelligence
On the computational complexity of coalitional resource games
Artificial Intelligence
A DNA-based simulation model for bounded fan-in Boolean circuits
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
On the monotone circuit complexity of quadratic boolean functions
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the incompressibility of monotone DNFs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Relating the semantics of abstract dialectical frameworks and standard AFs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
| Hi-index | 0.01 |