366 search results - page 31 / 74 » Four equivalent equivalences of reductions |
102
Voted
JCO
2007
15 years 19 days ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
81
Voted
ECCC
2010
15 years 24 days ago
2010
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization r...
100
Voted
COMBINATORICS
2002
15 years 17 days ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
107
click to vote
TPHOL
2000
IEEE
15 years 5 months ago
2000
IEEE
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
111
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...