154 search results - page 14 / 31 » Equivalence Problems for Circuits over Sets of Natural Numbe... |
ECCC
2008
13 years 7 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...
CVPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
MLQ
2002
13 years 7 months ago
2002
Abstract. In this paper I compare two well studied approaches to topological semantics-the domain-theoretic approach, exemplified by the category of countably based equilogical spa...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...