364 search results - page 30 / 73 » Dimension Characterizations of Complexity Classes |
SIAMCOMP
2010
13 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
SEKE
2001
Springer
13 years 11 months ago
2001
Springer
Ontologies are an emerging paradigm to support declarativity, interoperability, and intelligent services in many areas, such as Agent–based Computation, Distributed Information ...
MP
2011
13 years 2 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...