Parallel Time and Quantifier Prefixes
. We characterize the amount of alternation between blocks of Boolean quantifiers (having both existential and universal), blocks of real existential quantifiers, and blocks of real universal quantifiers that can be decided in parallel polynomial time over the reals. We do so under the assumption th...
Saved in:
| Published in | Computational complexity Vol. 18; no. 4; pp. 527 - 550 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Basel
Birkhäuser-Verlag
01.12.2009
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1016-3328 1420-8954 |
| DOI | 10.1007/s00037-009-0264-6 |
Cover
| Abstract | .
We characterize the amount of alternation between blocks of Boolean quantifiers (having both existential and universal), blocks of real existential quantifiers, and blocks of real universal quantifiers that can be decided in parallel polynomial time over the reals. We do so under the assumption that blocks have a uniform bound on their size, both for the case of this bound to be polynomial and constant. On the way towards this characterization we prove a real version of Savitch’s Theorem. |
|---|---|
| AbstractList | .
We characterize the amount of alternation between blocks of Boolean quantifiers (having both existential and universal), blocks of real existential quantifiers, and blocks of real universal quantifiers that can be decided in parallel polynomial time over the reals. We do so under the assumption that blocks have a uniform bound on their size, both for the case of this bound to be polynomial and constant. On the way towards this characterization we prove a real version of Savitch’s Theorem. |
| Author | Cucker, Felipe de Naurois, Paulin Jacobé |
| Author_xml | – sequence: 1 givenname: Felipe surname: Cucker fullname: Cucker, Felipe email: macucker@cityu.edu.hk organization: Department of Mathematics, City University of Hong Kong – sequence: 2 givenname: Paulin Jacobé surname: de Naurois fullname: de Naurois, Paulin Jacobé organization: CNRS UMR 7030 – LIPN, Université Paris 13 |
| BookMark | eNp9j01Lw0AQhhepYFv9Ad5y8bg6s19JjlLUCgUr1POyyc5KSrqR3Rb035sSz55mDvPM-z4LNotDJMZuEe4RoHzIACBLDlBzEEZxc8HmqATwqtZqNu6Ahkspqiu2yHkPgLqSas7uti65vqe-2HUHKlz0xfvJxWMXOkrFNlHovilfs8vg-kw3f3PJPp6fdqs137y9vK4eN7wVpTxyKUyQpExTu4Ba1-ABvMJglK6InNcNtmXly6Y1KugahZfOIaI0KAx5KZcMp79tGnIew-1X6g4u_VgEe_a0k6cdPe3Z05qREROTx9v4Scnuh1OKY81_oF-xoVWw |
| ContentType | Journal Article |
| Copyright | Birkhäuser Verlag, Basel 2009 |
| Copyright_xml | – notice: Birkhäuser Verlag, Basel 2009 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s00037-009-0264-6 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1420-8954 |
| EndPage | 550 |
| ExternalDocumentID | 10_1007_s00037_009_0264_6 |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- MBV N2Q N9A NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c273t-326f3e46b9af15590d00d41f6458eead5b1c78d7bc64f5912d3aa11136126ed33 |
| IEDL.DBID | AGYKE |
| ISSN | 1016-3328 |
| IngestDate | Tue Jul 01 01:36:14 EDT 2025 Fri Feb 21 02:32:58 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | 68Q15 alternation complexity classes parallel time Quantifier prefixes |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c273t-326f3e46b9af15590d00d41f6458eead5b1c78d7bc64f5912d3aa11136126ed33 |
| PageCount | 24 |
| ParticipantIDs | crossref_primary_10_1007_s00037_009_0264_6 springer_journals_10_1007_s00037_009_0264_6 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2009-12-01 |
| PublicationDateYYYYMMDD | 2009-12-01 |
| PublicationDate_xml | – month: 12 year: 2009 text: 2009-12-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Computational complexity |
| PublicationTitleAbbrev | comput. complex |
| PublicationYear | 2009 |
| Publisher | Birkhäuser-Verlag |
| Publisher_xml | – name: Birkhäuser-Verlag |
| SSID | ssj0015834 |
| Score | 1.7815627 |
| Snippet | .
We characterize the amount of alternation between blocks of Boolean quantifiers (having both existential and universal), blocks of real existential... |
| SourceID | crossref springer |
| SourceType | Index Database Publisher |
| StartPage | 527 |
| SubjectTerms | Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science |
| Title | Parallel Time and Quantifier Prefixes |
| URI | https://link.springer.com/article/10.1007/s00037-009-0264-6 |
| Volume | 18 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB20vejBalWsH2UPelFSsrtJmj220lqUlgot1NOy2SQgyirtFsRfb7JfUNFD70nIDjM7j7yZNwDXVkM90FigWCuBSExNzHHNkBSsS5RJ0RLbfufxhI3m5HFBF0Uf96qsdi8pyexPXTW7ZVopKHvMN1kcsV2oU5cHvAb13sPL06AiDyjPyWSDZpDve7wkM_86ZDMdbXKhWYoZNmBWXi6vLHnrrFPRib9_6TZueftDOCggp9PLfeQIdlTShEY5zsEporsJ--NKwnV1DDfTaGnnrLw7tkvEiRLpPK-jrLTIbJqaL3n9UqsTmA8Hs_sRKmYqoNgAlRQZtKZ9RZgIIm0ZSSwxlsTVjFCujFdR4cZdLrsiZkTTwPWkH0V2HL1BQkxJ3z-FWvKRqDNwqKc4FpgL4UkSW6zGXK0NPKMRpzLgLbgtTRt-5tIZYSWSnJkjNJtCa46QteCutFtYRNHq_9XnW62-gD2vmPqA3Uuopcu1ujJQIhVt4zrDfn_SLlyoDbtzr_cDghC_Ig |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7oPKgHf0zF-bMHvSiBtE2y9CjimLqNCRvsFpImAUGqrBv455tkbWGgB-9JA-81eR_58r4P4MZrqGcWK5RboxDJqdtz3DKkFesS40q0xr7feThi_Sl5mdFZ1cdd1q_da0oynNRNs1vQSkHhMt9VccQ2YcthAe5tC6bJQ0MdUL6ikh2WQWma8JrK_O0T68VonQkNBaZ3AHsVMoweVqk8hA1TtGG_dl2Iqk3Yht1ho7RaHsHtWM69HcpH5Js5Ilno6G0pwwsgN2nslnz_NuUxTHtPk8c-qqwPUO7wxAI5UGVTQ5jKpPXEIdYYaxJbRig3LvlUxXmX667KGbE0ixOdSuld4x1gYUan6Qm0is_CnEJEE8OxwlypRJPcQyoWW-siRyWnOuMduKtjIL5WChei0TIOARNukvABE6wD93WURPWzl3-PPvvX6GvY7k-GAzF4Hr2ew05SGTXg-AJai_nSXLrqv1BXIds_CHqi3g |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7oBNEHL1NxXvugL0pY2iZZ-jjUMS8bExzsLTRNAgOpY-3An2_SGwz0wfckhZOTno98Od8HcOM01CODJUqMlogk1J45bhhSkvWItiVaYdfvPBqz4ZS8zOis8jnN6tfuNSVZ9jQ4laY07y6U6TaNb4VuCiou9m1FR2wTtuzf2HeJPg36DY1AeUkrW1yDwjDgNa352xLrhWmdFS2KzeAA9iqU6PXLbT2EDZ22Yb92YPCqA9mG3VGjupodwe0kXjprlE_PNXZ4caq891VcvAaykyb2k_NvnR3DdPD08TBElQ0CSiy2yJEFWCbUhMkoNo5ExApjRXzDCOXaJgKVftLjqicTRgyN_ECFcewc5C14YVqF4Qm00q9Un4JHA82xxFzKQJHEwSvmG2MRFY05VRHvwF0dA7Eo1S5Eo2tcBEzYScIFTLAO3NdRElXiZ3-PPvvX6GvYnjwOxNvz-PUcdoLKswH7F9DKlyt9aYFALq-Kzf4BHeGnGg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+Time+and+Quantifier+Prefixes&rft.jtitle=Computational+complexity&rft.au=Cucker%2C+Felipe&rft.au=de+Naurois%2C+Paulin+Jacob%C3%A9&rft.date=2009-12-01&rft.issn=1016-3328&rft.eissn=1420-8954&rft.volume=18&rft.issue=4&rft.spage=527&rft.epage=550&rft_id=info:doi/10.1007%2Fs00037-009-0264-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00037_009_0264_6 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1016-3328&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1016-3328&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1016-3328&client=summon |