1410 search results - page 103 / 282 » Proving theorems by reuse |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
A separation context is a client program which does not dereference internals of a module with which it interacts. We use certain "precise" relations to unambiguously des...
FOCS
1991
IEEE
14 years 1 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
ECCC
2008
13 years 10 months ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
DM
2006
13 years 10 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...