Sciweavers

15033 search results - page 33 / 3007
» Complexity Theory and Algorithms
Sort
View
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
15 years 3 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
CCS
2004
ACM
15 years 3 months ago
Concealing complex policies with hidden credentials
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
Robert W. Bradshaw, Jason E. Holt, Kent E. Seamons
AAAI
2000
14 years 11 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
AI
2011
Springer
14 years 4 months ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
LPAR
2000
Springer
15 years 1 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob