983 search results - page 44 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
CC
2007
Springer
13 years 10 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
ECAI
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
ATAL
2005
Springer
14 years 4 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
ICCAD
1996
IEEE
14 years 2 months ago
1996
IEEE
This paper presents a new framework for formal logic verification. What is depicted here is fundamentally different from previous approaches. In earlier approaches, the circuit is ...
POPL
2009
ACM
14 years 11 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...