973 search results - page 8 / 195 » New Bounds on Crossing Numbers |
93
Voted
EJC
1998
15 years 1 months ago
1998
110
click to vote
DCG
1999
15 years 1 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 ...
DATE
2002
IEEE
15 years 6 months ago
2002
IEEE
This paper addresses verifying the timing of circuits containing level-sensitive latches in the presence of cross talk. We show that three consecutive periodic occurrences of the ...
132
click to vote
DCG
2010
15 years 13 days ago
2010
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type, for which the minimum number of Reidemeister moves required to pass to E is quadratic with ...
116
click to vote
JCT
2007
15 years 1 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...