7106 search results - page 111 / 1422 » Restricted Complexity, General Complexity |
142
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
143
Voted
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
103
Voted
AI
2005
Springer
15 years 2 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
115
Voted
CCE
2005
15 years 2 months ago
2005
Computational fluid dynamics (CFD) of complex processes and complicated geometries embraces the transport of momentum, heat, and mass including the description of reaction kinetic...
168
Voted
SIAMCOMP
2010
15 years 1 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...