1795 search results - page 142 / 359 » On the Complexity of Circuit Satisfiability |
STOC
2003
ACM
14 years 9 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
PODS
2003
ACM
14 years 9 months ago
2003
ACM
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
ICRA
2007
IEEE
14 years 3 months ago
2007
IEEE
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
CP
2007
Springer
14 years 3 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
INFOCOM
1994
IEEE
14 years 1 months ago
1994
IEEE
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...