19320 search results - page 265 / 3864 » On the complexity of computing determinants |
150
click to vote
CIE
2007
Springer
16 years 25 days ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
163
click to vote
COLING
1992
15 years 7 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
221
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
160
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notio...
197
click to vote
NIPS
2000
15 years 8 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...