In this paper, we automatically extract statistical terms and build their co-occurrence networks from newspapers. Statistical terms are expression of the measurements of statistics to watch the movements of phenomena; birth rates, public approval rating of the Cabinet and so on. In recent years, we have a vast amount of available information because of computerization and the technologies of ma...

Checking copositivity of a matrix is a co-NP-complete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out if a matrix with exactly one negative eigenvalue is strictly copositive or not can be formulated ...

This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].

Two vertices in a graph are called an even pair (odd pair) if all induced paths between these two vertices have even (odd) length. Even and odd pairs have turned out to be of importance in conjunction with perfect graphs. We will characterize all linegraphs of bipartite graphs that contain an even resp. odd pair. In general, it is a co-NP-complete problem to decide whether a graph contains an e...

We show that it is NP-Complete to decide whether a bimatrix game is degenerate and it is Co-NP-Complete to decide whether a bimatrix game is nondegenerate.

This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].

The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment with counting is co-NP-complete.