373 search results - page 11 / 75 » Learning Arithmetic Circuits |
FTTCS
2010
13 years 6 months ago
2010
ECCC
2010
13 years 3 months ago
2010
IACR
2011
12 years 8 months ago
2011
FCT
2009
Springer
14 years 3 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
CSR
2010
Springer
14 years 1 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...