1007 search results - page 74 / 202 » The Complexity of Futile Questioning |
122
click to vote
TOC
2008
15 years 3 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
121
click to vote
ICSE
2007
IEEE-ACM
16 years 3 months ago
2007
IEEE-ACM
Software reuse has long been promoted as a means to increase developer productivity; however, reusing source code is difficult in practice and tends to be performed in an ad hoc m...
113
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
120
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
130
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...