Sciweavers

29908 search results - page 225 / 5982
» On the complexity of communication complexity
Sort
View
DEDS
2006
78views more  DEDS 2006»
15 years 6 months ago
The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems
In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). ...
Yu-Chi Ho, Qing-Shan Jia, Qianchuan Zhao
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 6 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
JCO
2007
56views more  JCO 2007»
15 years 6 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
TSMC
2008
100views more  TSMC 2008»
15 years 6 months ago
Synchronization and State Estimation for Discrete-Time Complex Networks With Distributed Delays
Abstract--In this paper, a synchronization problem is investigated for an array of coupled complex discrete-time networks with the simultaneous presence of both the discrete and di...
Yurong Liu, Zidong Wang, Jinling Liang, Xiaohui Li...
MFCS
2010
Springer
15 years 5 months ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...