6274 search results - page 96 / 1255 » From query complexity to computational complexity |
123
Voted
ISLPED
1996
ACM
15 years 8 months ago
1996
ACM
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
145
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
124
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
175
click to vote
CHI
2011
ACM
14 years 7 months ago
2011
ACM
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...
143
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...