983 search results - page 64 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
CJTCS
1999
13 years 10 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
DAC
2006
ACM
14 years 4 months ago
2006
ACM
Silicon design implementation has become increasingly complex with the deep submicron technologies such as 90nm and below. It is common to see multiple processor cores, several ty...
CASC
2009
Springer
13 years 11 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
AEI
1998
13 years 10 months ago
1998
Functional labels provide a simple but very reusable way for defining the functionality of a system and for making use of that knowledge. Unlike more complex functional representa...
HPDC
2010
IEEE
13 years 11 months ago
2010
IEEE
A common task in biological research is to predict function for proteins by comparing sequences between proteins of known and unknown function. This is often done using pair-wise ...