2957 search results - page 101 / 592 » The Complexity of Polynomial-Time Approximation |
148
click to vote
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...
121
click to vote
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
131
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
105
click to vote
AI
2005
Springer
15 years 3 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...
141
click to vote
CIE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...