1139 search results - page 57 / 228 » Bounded Ideation Theory |
STOC
1993
ACM
14 years 1 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...
JNS
2010
13 years 4 months ago
2010
We consider statistical mechanics systems defined on a set with some symmetry properties (namely, the set admits an action by a group, which is finitely generated and residually fi...
WISEC
2009
ACM
14 years 4 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
ICLP
2003
Springer
14 years 2 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...