2430 search results - page 126 / 486 » Computing Tutte Polynomials |
116
click to vote
MOR
2008
15 years 4 months ago
2008
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
133
click to vote
JSC
2007
15 years 4 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
139
click to vote
DAM
2002
15 years 4 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
180
click to vote
ASIACRYPT
2011
Springer
14 years 5 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
163
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...