2661 search results - page 133 / 533 » Quantum Complexity Classes |
121
Voted
TARK
2007
Springer
15 years 9 months ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
126
click to vote
WAPCV
2007
Springer
15 years 9 months ago
2007
Springer
We present an experimental comparison of the performance of representative saliency detectors from three guiding principles for the detection of salient image locations: locations...
161
click to vote
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
114
click to vote
UC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
JELIA
2004
Springer
15 years 8 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...