2446 search results - page 148 / 490 » Choiceless Polynomial Time |
103
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
130
Voted
SAGT
2009
Springer
15 years 5 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
109
click to vote
ACMSE
2006
ACM
15 years 4 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
COMPSAC
2004
IEEE
15 years 4 months ago
2004
IEEE
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...
118
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...