3946 search results - page 92 / 790 » The computational complexity of choice sets |
WSC
2007
15 years 2 months ago
2007
Since its beginning, simulation has been used to study complex systems in order to infer on their future behavior, in this field several applications have been made using it as of...
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
IANDC
2008
14 years 12 months ago
2008
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...