11 October 1994 Selected Papers of the Workshop on Continuous Algorithms and Complexity,
- Felipe Cucker, Mike Shub, Steve Smale:
Separation of Complexity Classes in Koiran's Weak Model.
- T. Emerson:
Relativizations of the P=?NP Question over the Reals (and other Ordered Rings).
- Dima Grigoriev:
Deviation Theorems for Solutions of Differential Equations and Applications to Lower Bounds on Parallel Complexity of Sigmoids.
- Pascal Koiran:
Computing over the Reals with Addition and Order.
- Petr Kurka:
Regular Unimodal Systems and Factors of Finite Automata.
- Gregorio Malajovich:
On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis.
- Klaus Meer:
On the Complexity of Quadratic Programming in Real Number Models of Computation.
- Christian Michaux:
P != NP over the Nonstandard Reals Implies P != NP over R.
- J. Maurice Rojas:
A Convex Geometric Approach to Counting the Roots of a Polynomial System.
- Mike Shub, Steve Smale:
Complexity of Bezout's Theorem V: Polynomial Time.
- Jan Verschelde, Ann Haegemans:
Homotopies for Solving Polynomial Systems Within a Bounded Domain.
- Mike Paterson:
David Michael Ritchie Park (1935-1990) in Memoriam.
24 October 1994 Special Issue on Formal Methods in Databases and Software Engineering
Copyright © Mon Nov 2 21:55:59 2009
by Michael Ley (email@example.com)