2661 search results - page 156 / 533 » Quantum Complexity Classes |
139
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
132
Voted
ECCC
2011
14 years 7 months ago
2011
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
154
Voted
STOC
2010
ACM
16 years 24 days ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
163
Voted
WCRE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Code smells are poor implementation choices, thought to make object-oriented systems hard to maintain. In this study, we investigate if classes with code smells are more change-...
128
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...