Search

Your search keyword '"Steiger, William"' showing total 1 results
Start Over Author "Steiger, William" Topic computational complexity
1 results on '"Steiger, William"'

1. Some Combinatorial and Algorithmic Applications of the Borsuk–Ulam Theorem.

Author

Roy, Sambuddha and Steiger, William

Subjects
*COMBINATORIAL set theory, *ALGEBRAIC topology, *ALGEBRAIC geometry, *ALGORITHMS, *COMPUTATIONAL complexity
Abstract

The Borsuk–Ulam theorem has many applications in algebraic topology, algebraic geomtry, and combinatorics. Here we study some combinatorial consequences, typically asserting the existence of a certain combinatorial object. An interesting aspect is the computational complexity of algorithms that search for the object. The study of these algorithms is facilitated by direct combinatorial existence proofs that bypass Borsuk–Ulam. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results