Sciweavers

4865 search results - page 252 / 973
» The Complexity of Graph Connectivity
Sort
View
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
15 years 9 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
IJON
2000
73views more  IJON 2000»
15 years 6 months ago
A recurrent network model for the phase invariance of complex cell responses
Cortical amplification is a mechanism for modifying the selectivity of neurons through recurrent interactions. Although conventionally used to enhance selectivity, cortical amplif...
Frances S. Chance, Sacha B. Nelson, L. F. Abbott
COCOON
2008
Springer
15 years 8 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
BIB
2007
99views more  BIB 2007»
15 years 6 months ago
Towards a calculus of biomolecular complexes at equilibrium
An overview is presented of the construction and use of algebraic partition functions to represent the equilibrium statistical mechanics of multimolecular complexes and their acti...
Eric Mjolsness
COMSIS
2010
15 years 3 months ago
Metrics for evaluation of metaprogram complexity
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
Robertas Damasevicius, Vytautas Stuikys