15033 search results - page 67 / 3007 » Complexity Theory and Algorithms |
109
Voted
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
166
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
130
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
164
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
97
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...