1007 search results - page 57 / 202 » The Complexity of Futile Questioning |
127
click to vote
CCA
2005
Springer
15 years 6 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
156
click to vote
FLAIRS
2003
15 years 5 months ago
2003
In this paper we address the question of assigning social norms to agents: should we attempt to ascribe social norms to agents that will act in complex dynamic environments, or is...
128
Voted
IPL
2007
15 years 3 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
149
Voted
SIAMCO
2011
14 years 11 months ago
2011
Let R be a commutative complex Banach algebra with the involution ·⋆ and suppose that A ∈ Rn×n , B ∈ Rn×m , C ∈ Rp×n . The question of when the Riccati equation PBB⋆ ...
124
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...