Sciweavers

6 search results - page 2 / 2
» Space Complexity of Perfect Matching in Bounded Genus Bipart...
Sort
View
BIRTHDAY
2010
Springer
13 years 12 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman