Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decided
Add to Reading List
Document Date: 2011-09-22 08:25:51
Open Document
File Size: 339,03 KB
Share Result on Facebook
Company
BP /
/
Currency
pence /
/
IndustryTerm
topological tools /
quantifier elimination algorithms /
polynomial systems /
/
Organization
National Science Foundation /
/
Position
Prime Minister /
author /
/
Technology
quantifier elimination algorithms /
/
SocialTag
Applied mathematics
Constructible universe
Polynomial
Time hierarchy theorem
Algebraic geometry
Real closed field
Karp–Lipton theorem
Constructible number
Mathematics
Structural complexity theory