Sciweavers

2479 search results - page 252 / 496
» Quantum complexity theory
Sort
View
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 11 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
IPMU
1992
Springer
15 years 10 months ago
Rule-Based Systems with Unreliable Conditions
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
L. Cardona, Jürg Kohlas, Paul-André Mo...
156
Voted
ACOM
2004
Springer
15 years 10 months ago
A Model of Rational Agency for Communicating Agents
The Cognitive Agent Specification Language (CASL) is a framework for specifying and verifying complex communicating multiagent systems. In this paper, we develop an extended versi...
Shakil M. Khan, Yves Lespérance
FOCS
2004
IEEE
15 years 10 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot