10054 search results - page 292 / 2011 » On the Complexity of Function Learning |
184
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
175
click to vote
IJCNN
2006
IEEE
16 years 21 days ago
2006
IEEE
— Inspired by the universal laws governing different kinds of complex networks, we propose a scale-free highlyclustered echo state network (SHESN). Different from echo state netw...
156
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
182
click to vote
ICALP
2004
Springer
16 years 1 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
176
click to vote
ISLPED
1995
ACM
15 years 10 months ago
1995
ACM
Thispaper proposes a method for achieving low-power control-logic modules using a combination of CMOS complex gate reorganization, transistor size optimization, and transistor lay...