1007 search results - page 32 / 202 » The Complexity of Futile Questioning |
COCO
2009
Springer
14 years 4 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
SAC
2005
ACM
14 years 3 months ago
2005
ACM
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...
ECCC
2008
13 years 9 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
PODS
2010
ACM
14 years 2 months ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...