6142 search results - page 968 / 1229 » The Complexity of Partition Functions |
199
click to vote
EUROMICRO
1999
IEEE
15 years 11 months ago
1999
IEEE
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
171
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
167
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
High-level power design presents a complex, multiobjective problem that involves the simultaneous optimisation of competing criteria such as speed, area and power. It is difficult...
189
click to vote
COCO
1999
Springer
15 years 11 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
166
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...