Sciweavers

2661 search results - page 60 / 533
» Quantum Complexity Classes
Sort
View
92
Voted
ICPR
2006
IEEE
15 years 6 months ago
Class Separability in Spaces Reduced By Feature Selection
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
Erinija Pranckeviciene, TinKam Ho, Ray L. Somorjai
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 21 days ago
Settling the Complexity of Computing Two-Player Nash Equilibria
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)
Xi Chen, Xiaotie Deng, Shang-Hua Teng
94
Voted
ESAW
2007
Springer
15 years 7 months ago
Amongst First-Class Protocols
The ubiquity of our increasingly distributed and complex computing environments have necessitated the development of programming approaches and paradigms that can automatically man...
Tim Miller, Jarred McGinnis
93
Voted
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
15 years 15 days ago
The Complexity of the A B C Problem
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
90
Voted
CSL
2010
Springer
15 years 25 days ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe