Sciweavers

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

9

ICALP
2007
Springer

favoriteEmaildiscussreport

95views Programming Languages» more ICALP 2007»

Exotic Quantifiers, Complexity Classes, and Complete Problems

13 years 8 months ago

Exotic Quantifiers, Complexity Classes, and Complete Problems

Download math-www.uni-paderborn.de

Peter Bürgisser, Felipe Cucker

Real-time Traffic

ICALP 2007 | Programming Languages |

claim paper

Related Content

» Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languag...

» Quantified Positive Temporal Constraints

» Complete Problems for Dynamic Complexity Classes

» Quantified Equality Constraints

» Quantifying Homology Classes

» Some Decision Problems of Enormous Complexity

» On Models for Quantified Boolean Formulas

» Towards a unifying characterization for quantifying weak coupling in decPOMDPs

» The complexity of partition tasks

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2007
Where	ICALP
Authors	Peter Bürgisser, Felipe Cucker

Comments (0)