Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
sav08:remarks_on_ws1s_complexity [2009/04/17 15:23] vkuncak |
sav08:remarks_on_ws1s_complexity [2010/11/23 19:29] (current) hossein |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== Remarks on WS1S Complexity ====== | ====== Remarks on WS1S Complexity ====== | ||
+ | |||
+ | |||
===== Complexity of One Algorithm ===== | ===== Complexity of One Algorithm ===== | ||
- | The construction in [[Using Automata to Decide WS1S]] determinizes automaton whenever it needs to perform negation. Moreover, existential quantifier forces the automaton to be non-deterministic. Therefore, with every alternation between $\exists$ and $\forall$ we obtain an exponential blowup. For formula with n alternations we have $2^{2^{\ldots 2}}$ complexity with a stack of exponentials of height $n$. Is there a better algorithm? | + | The construction in [[Using Automata to Decide WS1S]] determinizes automaton whenever it needs to perform negation. Moreover, existential quantifier forces the automaton to be non-deterministic. Therefore, with every alternation between $\exists$ and $\forall$ we obtain an exponential blowup. For formula with n alternations we have $2^{2^{\ldots 2^{n}}}$ complexity with a stack of exponentials of height $n$. Is there a better algorithm? |
+ | |||
+ | |||
+ | ===== Reference ===== | ||
+ | A. R. Meyer: [[http://publications.csail.mit.edu/lcs/specpub.php?id=37|Weak monadic second order theory of successor is not elementary recursive]], Preliminary Report, 1973. | ||
===== Lower Bound ===== | ===== Lower Bound ===== | ||
Line 10: | Line 16: | ||
* [[http://theory.csail.mit.edu/~meyer/stock-circuit-jacm.pdf|Cosmological Lower Bound on the Circuit Complexity of a Small Problem in Logic]] (See the introduction and the conclusion sections) | * [[http://theory.csail.mit.edu/~meyer/stock-circuit-jacm.pdf|Cosmological Lower Bound on the Circuit Complexity of a Small Problem in Logic]] (See the introduction and the conclusion sections) | ||
- | * circuit versus assymptotic time complexity (uniformity, specific instance versus assymptotic bound) | ||
- | * the density question | ||
- | * do we need to know how to check validity for all MSOL formulas | ||