4940 search results - page 257 / 988 » On the Complexity of Universal Programs |
177
click to vote
AIEDAM
2008
15 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
131
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
201
click to vote
CL
2000
Springer
15 years 6 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
200
click to vote
ICASSP
2011
IEEE
14 years 10 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...
162
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...