29908 search results - page 379 / 5982 » On the complexity of communication complexity |
193
click to vote
GECCO
2005
Springer
16 years 10 days ago
2005
Springer
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
232
click to vote
ISAAC
2005
Springer
16 years 9 days ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
151
Voted
IVA
2005
Springer
16 years 9 days ago
2005
Springer
An important characteristic of a virtual human is the ability to direct its perceptual attention to entities and areas in a virtual environment in a manner that appears believable ...
166
click to vote
MFCS
2005
Springer
16 years 9 days ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
164
Voted
ARITH
2003
IEEE
16 years 3 days ago
2003
IEEE
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a comp...