1795 search results - page 120 / 359 » On the Complexity of Circuit Satisfiability |
154
Voted
CSR
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
149
click to vote
EURODAC
1995
IEEE
15 years 9 months ago
1995
IEEE
Because it costs to solve ElectroMagnetic Compatibility (EMC) problems late in the development process, new methods have to predict radiated electromagnetic emissions at the desig...
155
click to vote
EJC
2002
15 years 5 months ago
2002
The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal (M) generated by the boundaries of the circuits of the matroid. There i...
180
click to vote
HOTNETS
2010
15 years 29 days ago
2010
Full-bandwidth connectivity between all servers of a data center may be necessary for all-to-all traffic patterns, but such interconnects suffer from high cost, complexity, and en...
159
Voted
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Post-silicon validation has become an essential step in the design flow of today's complex integrated circuits. One effective technique that provides real-time visibility to ...