15033 search results - page 230 / 3007 » Complexity Theory and Algorithms |
124
click to vote
CHI
2007
ACM
16 years 5 months ago
2007
ACM
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
156
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
127
click to vote
IFIP
2000
Springer
15 years 8 months ago
2000
Springer
New non-desktop technologies may turn out to be of a more open and generic nature than traditional information technologies. These technologies consequently pose novel challenges ...
132
click to vote
AAAI
2000
15 years 6 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
126
click to vote
IPL
2006
15 years 4 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...