420 search results - page 34 / 84 » Some Algorithmic Problems in Polytope Theory |
113
click to vote
AAAI
2007
15 years 6 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
129
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
138
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
131
Voted
ASIAN
2006
Springer
15 years 7 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
123
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...