An \(n\times n\) real matrix is called a \(P\)-matrix if all its principal minors are positive. The \(P\)-matrix completion problem asks which partial \(P\)-matrices have a completion to a \(P\)-matrix. The authors prove that every partial \(P\)-matrix with combinatorially symmetric specified entries has a \(P\)-matrix completion. The general case, in which the combinatorial symmetry assumption is relaxed, is also discussed. Other completion problems, intermediate between the positive definite completion problem and the combinatorially symmetric \(P\)-matrix completion problem are open.