15033 search results - page 340 / 3007 » Complexity Theory and Algorithms |
170
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
244
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
222
click to vote
FSTTCS
1992
Springer
15 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
182
click to vote
IJVR
2008
15 years 7 months ago
2008
This paper intends to demonstrate the importance of a Linguistic approach for understanding the complexity implied in the simulations of the Built Environment. Indeed, it will be a...
208
click to vote
ECAI
2004
Springer
16 years 11 days ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...