1204 search results - page 137 / 241 » Termination of Polynomial Programs |
93
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
86
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
113
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
103
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
137
click to vote
COCO
2011
Springer
14 years 15 days ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...