1302 search results - page 119 / 261 » Free-Style Theorem Proving |
146
click to vote
ECCC
2008
15 years 4 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...
115
click to vote
CORR
2006
Springer
15 years 4 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...
104
click to vote
DM
2006
15 years 4 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...
124
click to vote
IJFCS
2008
15 years 4 months ago
2008
In this paper, we look at the extension of Hedlund's characterization of cellular automata to the case of cellular automata in the hyperbolic plane. This requires an addition...
126
click to vote
JAT
2008
15 years 4 months ago
2008
We use a generalization of Wiener's 1/f theorem to prove that for a Gabor frame with the generator in the Wiener amalgam space W (L , 1 )(Rd ), the corresponding frame operato...