Sciweavers

1795 search results - page 84 / 359
» On the Complexity of Circuit Satisfiability
Sort
View

Publication
303views
12 years 7 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
IACR
2011
128views more  IACR 2011»
12 years 8 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
ORL
2008
63views more  ORL 2008»
13 years 8 months ago
The inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
Dorit S. Hochbaum, Erick Moreno-Centeno
ICCD
2004
IEEE
103views Hardware» more  ICCD 2004»
14 years 5 months ago
A Fast Delay Analysis Algorithm for The Hybrid Structured Clock Network
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
Yi Zou, Yici Cai, Qiang Zhou, Xianlong Hong, Sheld...
ICANN
2005
Springer
14 years 2 months ago
A Model for Delay Activity Without Recurrent Excitation
Delay activity (DA) is the increased firing rate of a cortical population, which persists when the stimulus that induced it is removed. It is believed to be the neural substrate f...
Marc de Kamps