468 search results - page 70 / 94 » One-Way Functions in Complexity Theory |
103
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
STOC
2010
ACM
15 years 3 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
CMPB
2007
14 years 11 months ago
2007
We show that it is possible to construct numerical models of eye colour from first principles. Our initial model assumes that the important optical interactions occur only in the a...
STOC
2009
ACM
15 years 11 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
114
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...