A faster PSPACE algorithm for deciding the existential theory of the reals

Authors:
J. Renegar
Affiliations:
Sch. of Oper. Res.&Ind. Eng., Cornell Univ., Ithaca, NY, USA
Venue:
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Year:
1988

Citing 0
Cited 14

Computational algebraic geometry of projective configurations

Journal of Symbolic Computation
The complexity of deciding consistency of systems of polynomials in exponent inequalities

Journal of Symbolic Computation
Specified precision polynomial root isolation is in NC

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Complexity and Expressive Power of Logic Programming

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the intrinsic complexity of point finding in real singular hypersurfaces

Information Processing Letters
Numerica: a modeling language for global optimization

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Computation of equilibriain noncooperative games

Computers & Mathematics with Applications
Generalized polar varieties: geometry and algorithms

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Theory-specific automated reasoning

A 25-year perspective on logic programming
Model-Checking markov chains in the presence of uncertainties

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the complexity of minimizing probabilistic and quantum automata

Information and Computation
Sensitivity analysis using type-based constraints

Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages
A robust khintchine inequality, and algorithms for computing optimal constants in fourier analysis and high-dimensional geometry

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Unreliable point facility location problems on networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...