Results 1 to 10 of about 265,994 (263)
Some of the next articles are maybe not open access.
Problems in complete denture treatment
The Journal of Prosthetic Dentistry, 1968openaire +2 more sources
A connection between the moment problem and the subnormal completion problem
Journal of Mathematical Analysis and Applications, 2006exaly
The n-queens completion problem. [PDF]
AbstractAn n-queens configuration is a placement of n mutually non-attacking queens on an $$n\times n$$ n × n chessboard. The n-queens completion problem, introduced by Nauck in 1850, is to decide whether a given partial configuration can ...
Glock S, Munhá Correia D, Sudakov B.
europepmc +6 more sources
The CP-Matrix Completion Problem [PDF]
arXiv admin note: text overlap with arXiv:1210.6930 by other ...
Anwa Zhou, Jinyan Fan
exaly +3 more sources
An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors prove that a combinatorially symmetric partial \(N\)-matrix has an \(N\)-matrix completion if the graph of its specified entries is a 1-chordal graph.
C Mendes Araujo +2 more
exaly +4 more sources
The Q0-matrix completion problem [PDF]
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and
Kalyan Sinha
doaj +1 more source

