Sciweavers

29908 search results - page 184 / 5982
» On the Complexity of
Sort
View
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 6 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
CORR
2006
Springer
76views Education» more  CORR 2006»
15 years 6 months ago
Complexity Constrained Noise-Free CDMA: Optimal Power Distribution and Spectral Efficiency
The issue of multiuser cooperation in a complexity constrained noise-free CDMA channel is addressed. Multiuser cooperation is imperative if conventional demodulation is expected to...
Rodrigo de Miguel, Ralf R. Müller
JAIR
2008
123views more  JAIR 2008»
15 years 6 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
JCSS
2008
120views more  JCSS 2008»
15 years 6 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
MP
2006
101views more  MP 2006»
15 years 6 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie