Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

LICS
1999
IEEE

favoriteEmaildiscussreport

79views Automated Reasoning» more LICS 1999»

Some Decision Problems of Enormous Complexity

13 years 8 months ago

Some Decision Problems of Enormous Complexity

Download www.math.ohio-state.edu

We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic logical notions. Their complexities range from iterated exponential time completeness to 0 time completeness to ( ,0) time completeness to (,,0) time completeness. These three ordinals are well known ordinals from proof theory, and their associated complexity classes represent new levels of computational complexity for natural decision problems. Proofs will appear in an extended version of this manuscript to be published elsewhere.

Harvey Friedman

Real-time Traffic

Automated Reasoning | Computational Complexity | Exponential Time Completeness | LICS 1999 | Time Completeness |

claim paper

Related Content

» Some natural decision problems in automatic graphs

» The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension

» A forwardbackward Monte Carlo method for solving influence diagrams

» Complexity of Decision Problems for Simple Regular Expressions

» What makes some POMDP problems easy to approximate

» Policy Gradient Planning for Environmental Decision Making with Existing Simulators

» Some Computational Aspects of distancesat

» Search versus Decision for Election Manipulation Problems

» Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	LICS
Authors	Harvey Friedman

Comments (0)