6978 search results - page 364 / 1396 » On Proofs in System P |
174
click to vote
DCG
1999
15 years 6 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
190
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
221
click to vote
CPC
2011
15 years 1 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
171
Voted
RSA
2011
15 years 1 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
138
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper considers discrete-time periodic linear systems and their Floquet transformations, by which the periodic systems can be equivalently transformed to time-invariant on...