3946 search results - page 80 / 790 » The computational complexity of choice sets |
AAAI
2006
15 years 1 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
120
click to vote
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
CIE
2008
Springer
15 years 1 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
104
click to vote
ISPA
2007
Springer
15 years 6 months ago
2007
Springer
Grid and distributed public computing schemes has become an essential tool for many scientific fields including bioinformatics, computational biology and systems biology. The adopt...
CGA
2008
14 years 12 months ago
2008
Geometric computing with three-dimensional rotations and orientations is a fundamental issue in three-dimensional computer graphics. Our approach was inspired by affine geometry a...