Timeline for Extension of SQL capturing $\mathsf{P}$
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2012 at 3:04 | comment | added | Kaveh | I also don't see the relation of $\mathsf{NP}$ vs. $\mathsf{P}$ to my question. We already know that there are languages that capture $\mathsf{P}$, e.g. $\mathsf{FO(LFP)}$ (which is by the way not Turing complete). What I am asking is if there is a language extending SQL capturing $\mathsf{P}$ which is used in the industry and I want all of these to be satisfied (or an explanation why such a language is not interesting from the viewpoint of industry). | |
| Mar 9, 2012 at 3:00 | comment | added | Kaveh | when we say captures a complexity class we mean that exactly that complexity class. For example we say language $\mathsf{FO}$ captures complexity class $\mathsf{AC^0}$. | |
| Mar 9, 2012 at 0:18 | history | edited | Victor Stafusa | CC BY-SA 3.0 |
added 130 characters in body
|
| Mar 9, 2012 at 0:12 | history | answered | Victor Stafusa | CC BY-SA 3.0 |