14518 search results - page 61 / 2904 » Two Problems for Sophistication |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
CPM
2007
Springer
14 years 3 months ago
2007
Springer
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
SMI
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper considers computation of visibility for twodimensional shapes whose boundaries are C1 continuous curves. We assume we are given a one-parameter family of candidate view...
NIPS
2004
13 years 10 months ago
2004
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)