3946 search results - page 275 / 790 » The computational complexity of choice sets |
166
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized ...
157
click to vote
GI
2007
Springer
16 years 27 days ago
2007
Springer
: In addition to the growing complexity of software systems, test effort takes increasing amounts of time and correspondingly more money. Testing costs may be reduced without compr...
156
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
Logic synthesis systems are complex systems and algorithmic research in synthesis has become highly specialized. This creates a gap where it is often not clear how an advance in a...
201
click to vote
IJCGA
2006
15 years 6 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
163
click to vote
ENTCS
2007
15 years 6 months ago
2007
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...