2446 search results - page 114 / 490 » Choiceless Polynomial Time |
112
Voted
JCP
2006
15 years 21 days ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
102
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
128
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
96
Voted
FOCS
1990
IEEE
15 years 4 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
COMPUTING
2007
15 years 22 days ago
2007
In this paper, we propose an approach to the computation of more accurate divided differences for the interpolation in the Newton form of the matrix exponential propagator ϕ(hA)v...