diff --git a/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h b/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h
index aba505f8d52..dcb55e254c3 100644
--- a/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h
+++ b/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h
@@ -40,13 +40,13 @@ public:
 /// @{
 
 /*! 
-introduces an uninitialized variable `fo`. 
+%Default constructor.
 
 */ 
 Exponent_vector(); 
 
 /*! 
-The copy constructor 
+The copy constructor. 
 
 */ 
 Exponent_vector(const Exponent_vector & ev_); 
@@ -154,10 +154,10 @@ operator<(const Exponent_vector &ev1, const Exponent_vector &ev2);
 }; /* end Exponent_vector */
 
 /*! 
-Returns true if all entries of ev are not negative. 
+Returns true if all entries of exponent vector `ev` are not negative. 
 \relates Exponent_vector 
 */ 
-bool is_valid(ev); 
+bool is_valid(const Exponent_vector& ev); 
 
 
 } /* end namespace CGAL */
diff --git a/Polynomial/doc/Polynomial/CGAL/Polynomial.h b/Polynomial/doc/Polynomial/CGAL/Polynomial.h
index 17d3a0ecbc7..d4729d469ac 100644
--- a/Polynomial/doc/Polynomial/CGAL/Polynomial.h
+++ b/Polynomial/doc/Polynomial/CGAL/Polynomial.h
@@ -4,7 +4,7 @@ namespace CGAL {
 \ingroup PkgPolynomialClasses
 
 An instance of the data type `Polynomial` represents a 
-polynomial \f$ p = a_0 + a_1*x + ...a_i*x^i\f$ from the ring \f$ Coeff[x]\f$. 
+polynomial \f$ p = a_0 + a_1*x + ...a_i*x^i\f$ from the ring \f$ \mathrm{Coeff}[x]\f$. 
 `Coeff` can itself be an instance of `Polynomial`, yielding a form of 
 multivariate polynomials. 
 
@@ -61,7 +61,7 @@ the zero polynomial is represented by a single zero coefficient.
 \models ImplicitInteroperable with int 
 \models ImplicitInteroperable with Coeff 
 \models Fraction if Coeff is model of ::Fraction 
-\models LessThanComparable if Coeff is model of LessThanComparable 
+\models LessThanComparable if Coeff is model of `LessThanComparable` 
 \models Modularizable if `Coeff` is model of `Modularizable`
 */
 template< typename Coeff >
diff --git a/Polynomial/doc/Polynomial/CGAL/Polynomial_type_generator.h b/Polynomial/doc/Polynomial/CGAL/Polynomial_type_generator.h
index ee271c8e050..5d6fbd7f758 100644
--- a/Polynomial/doc/Polynomial/CGAL/Polynomial_type_generator.h
+++ b/Polynomial/doc/Polynomial/CGAL/Polynomial_type_generator.h
@@ -10,7 +10,7 @@ This class template provides a convenient way to obtain the type representing a
 
 `d` must be of type int. 
 
-\sa CGAL::Polynomial<Coeff> 
+\sa `CGAL::Polynomial<Coeff>` 
 
 */
 template< typename T, typename d >
diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h
index 7f52053e93d..a78c43fc4ab 100644
--- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h
+++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h
@@ -3,7 +3,7 @@
 \ingroup PkgPolynomialConcepts
 \cgalconcept
 
-This `AdaptableBinaryFunction` computes whether the given 
+This `AdaptableUnaryFunction` computes whether the given 
 a polynomial of type `PolynomialTraits_d::Polynomial_d` 
 is square free. 
 
diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h
index 1edc236ec47..3fd1316901f 100644
--- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h
+++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h
@@ -3,7 +3,7 @@
 \ingroup PkgPolynomialConcepts
 \cgalconcept
 
-This `AdaptableBinaryFunction` computes the square-free part of 
+This `AdaptableUnaryFunction` computes the square-free part of 
 a polynomial of type `PolynomialTraits_d::Polynomial_d` 
 <I>up to a constant factor</I>. 
 
diff --git a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
index 9ed4e39b3d0..69b60912951 100644
--- a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
+++ b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
@@ -14,8 +14,8 @@ all functionality related to polynomials is provided by the traits.
 
 \refines ::IntegralDomainWithoutDivision 
 
-The algebraic structure of ::Polynomial_d depends on the 
-algebraic structure of ::Innermost_coefficient_type: 
+The algebraic structure of `Polynomial_d` depends on the 
+algebraic structure of `PolynomialTraits_d::Innermost_coefficient_type`: 
 
 Innermost_coefficient_type       | %Polynomial_d 
 ---------------------------------|--------------------------------