Sciweavers

1007 search results - page 73 / 202
» The Complexity of Futile Questioning
Sort
View
MKWI
2008
169views Business» more  MKWI 2008»
15 years 5 months ago
A Portal for Cross-Administrative Acquisition and Specification of Software Requirements
: For the development of software requirements within a team, efficient communication and a systematic approach are necessary. Because of the complexity of the task, the need for s...
Norman Riegel, Holger Branding, Michael Geisser, T...
DAGSTUHL
2006
15 years 5 months ago
Graphs and Circuits: Some Further Remarks
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
Stasys Jukna
123
Voted
NIPS
2003
15 years 5 months ago
Approximability of Probability Distributions
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
Alina Beygelzimer, Irina Rish
CSL
2010
Springer
15 years 4 months ago
Formal Theories for Linear Algebra
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
Stephen Cook, Lila Fontes
TCBB
2008
73views more  TCBB 2008»
15 years 3 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple