2214 search results - page 14 / 443 » Complexity of Reasoning |
CADE
2008
Springer
13 years 10 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
IRCDL
2008
13 years 10 months ago
2008
Annotation and retrieval tools for multimedia digital libraries have to cope with the complexity of multimedia content. In particular, when dealing with video content, annotation ...
SEMCO
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we present an approach that combines multimedia reasoning and natural language processing for the semantic integration of automatic and manual image annotations base...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...