Nicolai Vorobjov, 3 December 1992: THEORY

Thread View: ont.events

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Veronica Archibald Wed, 11 Nov 1992 16:22

#291

Author: Veronica Archibald
Date: Wed, 11 Nov 1992 16:22

24 lines
1429 bytes

           Department of Computer Science, University of Toronto
         (SF = Sandford Fleming Building, 10 King's College Road)

       -------------------------------------------------------------

                                  THEORY
                   SF1105, at 3:00 p.m., 3 December 1992

                             Nicolai Vorobjov
                                MSI Cornell

                         "COMPLEXITY OF COMPUTING
              TOPOLOGICAL PROPERTIES OF A SEMIALGEBRAIC SET"

In the last few years, some new effective algorithms have been developed
for basic computational problems in real algebraic geometry. The complexity
of the algorithms is singly-exponential in the number of variables, in
contrast to thepreviously known doubly-exponential upper time bounds. A
survey of these methods will be given with a more detailed description of
the most advanced of them: an algorithm for finding all connected
components of a semialgebraic set and a procedure for computing the
combinatorial type of a cell-decomposition of a smooth real algebraic
hypersurface.

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads