Sciweavers

29908 search results - page 367 / 5982
» On the complexity of communication complexity
Sort
View
161
Voted
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
Eigenvalue Results for Large Scale Random Vandermonde Matrices with Unit Complex Entries
Abstract--This paper centers on the limit eigenvalue distribution for random Vandermonde matrices with unit magnitude complex entries. The phases of the entries are chosen independ...
Gabriel H. Tucci, Philip A. Whiting
DISOPT
2008
89views more  DISOPT 2008»
15 years 6 months ago
Complexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
FUIN
2008
71views more  FUIN 2008»
15 years 6 months ago
Nonterminal Complexity of Some Operations on Context-Free Languages
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
Jürgen Dassow, Ralf Stiebe
CC
2006
Springer
133views System Software» more  CC 2006»
15 years 6 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx
CC
2006
Springer
147views System Software» more  CC 2006»
15 years 6 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena