Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP are defined in terms of the complexity of checking—upon presentation of an entire input—whether the input satisfies a certain property. For many applications of computers i...
Gespeichert in:
| Veröffentlicht in: | Journal of computer and system sciences Jg. 55; H. 2; S. 199 - 209 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.10.1997
|
| ISSN: | 0022-0000, 1090-2724 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP are defined in terms of the complexity of checking—upon presentation of an entire input—whether the input satisfies a certain property. For many applications of computers it is more appropriate to model the process as a dynamic one. There is a fairly large object being worked on over a period of time. The object is repeatedly modified by users and computations are performed. We develop a theory of dynamic complexity. We study the new complexity class, dynamic first-order logic (Dyn-FO). This is the set of properties that can be maintained and queried in first-order logic, i.e., relational calculus, on a relational database. We show that many interesting properties are in Dyn-FO, including multiplication, graph connectivity, bipartiteness, and the computation of minimum spanning trees. Note that none of these problems is in static FO, and this fact has been used to justify increasing the power of query languages beyond first-order. It is thus striking that these problems are indeed dynamic first-order and, thus, were computable in first-order database languages all along. We also define “bounded-expansion reductions” which honor dynamic complexity classes. We prove that certain standard complete problems for static complexity classes, such as REACHafor P, remain complete via these new reductions. On the other hand, we prove that other such problems, including REACH for NL and REACHdfor L, are no longer complete via bounded-expansion reductions. Furthermore, we show that a version of REACHa, called REACHa+, is not in Dyn-FO unless all of P is contained in parallel linear time. |
|---|---|
| AbstractList | Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP are defined in terms of the complexity of checking - upon presentation of an entire input - whether the input satisfies a certain property. For many applications of computers it is more appropriate to model the process as a dynamic one. There is a fairly large object being worked on over a period of time. The object is repeatedly modified by users and computations are performed. We develop a theory of dynamic complexity. We study the new complexity class, dynamic first-order logic (Dyn-FO). This is the set of properties that can be maintained and queried in first-order logic, i.e., relational calculus, on a relational database. We show that many interesting properties are in Dyn-FO, including multiplication, graph connectivity, bipartiteness, and the computation of minimum spanning trees. Note that none of these problems is in static FO, and this fact has been used to justify increasing the power of query languages beyond first-order. It is thus striking that these problems are indeed dynamic first-order and, thus, were computable in first-order database languages all along. We also define `bounded-expansion reductions' which honor dynamic complexity classes. We prove that certain standard complete problems for static complexity classes, such as REACH sub(a) for P, remain complete via these new reductions. On the other hand, we prove that other such problems, including REACH for NL and REACH sub(d) for L, are no longer complete via bounded-expansion reductions. Furthermore, we show that a version of REACH sub(a), called REACH super(+) sub(a), is not in Dyn-FO unless all of P is contained in parallel linear time. Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP are defined in terms of the complexity of checking—upon presentation of an entire input—whether the input satisfies a certain property. For many applications of computers it is more appropriate to model the process as a dynamic one. There is a fairly large object being worked on over a period of time. The object is repeatedly modified by users and computations are performed. We develop a theory of dynamic complexity. We study the new complexity class, dynamic first-order logic (Dyn-FO). This is the set of properties that can be maintained and queried in first-order logic, i.e., relational calculus, on a relational database. We show that many interesting properties are in Dyn-FO, including multiplication, graph connectivity, bipartiteness, and the computation of minimum spanning trees. Note that none of these problems is in static FO, and this fact has been used to justify increasing the power of query languages beyond first-order. It is thus striking that these problems are indeed dynamic first-order and, thus, were computable in first-order database languages all along. We also define “bounded-expansion reductions” which honor dynamic complexity classes. We prove that certain standard complete problems for static complexity classes, such as REACHafor P, remain complete via these new reductions. On the other hand, we prove that other such problems, including REACH for NL and REACHdfor L, are no longer complete via bounded-expansion reductions. Furthermore, we show that a version of REACHa, called REACHa+, is not in Dyn-FO unless all of P is contained in parallel linear time. |
| Author | Immerman, Neil Patnaik, Sushant |
| Author_xml | – sequence: 1 givenname: Sushant surname: Patnaik fullname: Patnaik, Sushant – sequence: 2 givenname: Neil surname: Immerman fullname: Immerman, Neil |
| BookMark | eNp1kM9LwzAUx4NMcJtePffkaa3vJf2RehvVqTCYBz2HLE0gI21n0on779cyT8Le5QuP7-fB-8zIpO1aTcg9QoIA-eNOhZBgWRYJZhSuyBShhJgWNJ2QKQClMQxzQ2Yh7AAQs5xNyeL52MarzVO0jD6kl85pt4iGnWysiqqu2Tv9a_tjVDkZwi25NtIFffeXc_K1evms3uL15vW9Wq5jxbDoY6xTo7ihJaYakUOe8YLXmiEzWyhr3KbAGZMZNTyTrCzMlpcpGpmCzGVR52xOHs539777PujQi8YGpZ2Tre4OQVDKkbGMD8XkXFS-C8FrI_beNtIfBYIYpYhRihiliFHKAKT_AGV72duu7b207jLGz5gevv6x2ougrG6Vrq3Xqhd1Zy-hJ5qmeSc |
| CitedBy_id | crossref_primary_10_1016_j_artint_2022_103726 crossref_primary_10_1145_2287718_2287719 crossref_primary_10_1145_2948896_2948899 crossref_primary_10_1016_S0304_3975_02_00740_5 crossref_primary_10_1145_3132701 crossref_primary_10_1145_1862919_1862926 crossref_primary_10_1145_1749608_1749613 crossref_primary_10_1145_1042046_1042050 crossref_primary_10_1145_3241040 crossref_primary_10_1016_j_artint_2018_12_004 crossref_primary_10_1016_j_ic_2014_09_011 crossref_primary_10_1145_3212685 crossref_primary_10_1145_3442322_3442325 crossref_primary_10_1016_j_ic_2017_04_005 crossref_primary_10_1063_1_3643063 crossref_primary_10_1007_s00453_022_00986_0 crossref_primary_10_1145_3232056 crossref_primary_10_1016_S0304_3975_99_00223_6 |
| Cites_doi | 10.1007/BF00263192 10.1016/0304-3975(94)90159-7 10.1006/inco.1995.1102 10.1137/0218043 10.1145/212433.220204 10.1016/0022-0000(82)90012-5 10.1016/0167-6423(94)00031-9 10.1109/LICS.1994.316065 10.1145/195058.195434 10.1145/158511.158710 10.1016/0022-0000(89)90037-8 10.1145/73007.73040 10.1145/182591.182614 10.1007/3-540-56039-4_56 10.1137/0216051 10.1016/0743-1066(87)90009-4 10.1145/359168.359175 10.1007/BF01744431 10.1109/SFCS.1992.267818 10.1007/3-540-56503-5_65 10.1016/0022-0000(81)90039-8 10.1006/inco.1995.1007 10.1109/SFCS.1991.185429 10.1016/0168-0072(83)90038-6 10.1145/170035.170066 10.1137/0214055 |
| ContentType | Journal Article |
| Copyright | 1997 Academic Press |
| Copyright_xml | – notice: 1997 Academic Press |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1006/jcss.1997.1520 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 209 |
| ExternalDocumentID | 10_1006_jcss_1997_1520 S0022000097915208 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c317t-1d4fc8f2914e118065878de313fb09d1b40833a52f85a397fb8941fa40a6a7d63 |
| ISICitedReferencesCount | 55 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1006_jcss_1997_1520&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-0000 |
| IngestDate | Sun Sep 28 10:28:49 EDT 2025 Sat Nov 29 04:01:29 EST 2025 Tue Nov 18 22:37:01 EST 2025 Fri Feb 23 02:17:22 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c317t-1d4fc8f2914e118065878de313fb09d1b40833a52f85a397fb8941fa40a6a7d63 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1006/jcss.1997.1520 |
| PQID | 22813358 |
| PQPubID | 23500 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_22813358 crossref_primary_10_1006_jcss_1997_1520 crossref_citationtrail_10_1006_jcss_1997_1520 elsevier_sciencedirect_doi_10_1006_jcss_1997_1520 |
| PublicationCentury | 1900 |
| PublicationDate | 1997-10-01 |
| PublicationDateYYYYMMDD | 1997-10-01 |
| PublicationDate_xml | – month: 10 year: 1997 text: 1997-10-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 1997 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | P. B. Miltersen, The bit probe complexity measure revisited, Proceedings of the Tenth Symposium on Theorecital Aspects of Computer Science, 1993 G. Ramalingam, T. Reps, 1993, A categorized bibliography on incremental computation, ACM Symp. Principles of Programming Languages, 502, 510 Frederickson (SS971520RF13) 1985; 14 J. A. Medina, N. Immerman, A syntactic characterization of NP-completeness, IEEE Symp. Logic in Comput. Sci, 1994, 241, 250 Lloyd, Sonenberg, Topor (SS971520RF26) 1987; 4 A. Borodin, R. Razborov, S. Smolensky, 1991, On lower bounds for read- Y. Ionanadis, A time bound on the materialization of some recursively defined views, Proceedings, International Conference on Very Large Data Bases, 1985 S. Patnaik, 1994, The dynamic complexity of approximation, Computer Science Dept. University of Massachusetts S. Patnaik, N. Immerman, 1994, Dyn-FO: A parallel, dynamic complexity class, ACM Symp. Principles Database Systems, 210, 221 Immerman (SS971520RF18) 1989; 38 Immerman (SS971520RF19) 1989; 18 D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, Sparsification and planarity testing, Proceedings, ACM Symposium on Theory of Computing, 1992 H. Jakobsson, On materializing views and on-line queries, Proceedings, International Conference on Database Theory, Berlin, 1992, 407, 420 Dong, Su, Topor (SS971520RF9) 1992; 646 Nicolas (SS971520RF30) 1982; 18 Chandra, Harel (SS971520RF5) 1982; 25 Liu, Teitelbaum (SS971520RF25) 1995; 24 Ajtai (SS971520RF1) 1983; 24 M. Fredman, M. Saks, The cell probe complexity of dynamic data structures, 21 st ACM STOC Symp, 1989, 345, 354 G. F. Frederickson, Ambivalent data structures for dynamic 2-edge connectivity and Immerman (SS971520RF21) 1981; 22 D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, Sparsification—A technique for speeding up dynamic graph algorithms, IEEE Found. Comput. Sci. Symp, 1992, 60, 69 M. Rauch, 1994, Improved data structures for fully dynamic biconnectivity, ACM Symp. Theory of Comput. 686, 695 Immerman (SS971520RF20) 1987; 16 Tarjan, Yao (SS971520RF34) 1979; 22 Furst, Saxe, Sipser (SS971520RF16) 1984; 17 Immerman, Landau (SS971520RF22) 1995; 116 Fagin (SS971520RF12) 1974; 7 Barrington, Corbett (SS971520RF3) 1989; 89–22 Dong, Su (SS971520RF8) 1995; 120 Barrington (SS971520RF2) 1989; 38 G. Dong, J. Su, Space-bounded FOIES, ACM Symp. Principles Database Systems, 1995, 139, 150 Miltersen, Subramanian, Vitter, Tamassia (SS971520RF29) 1994; 130 IEEE Found. of Comput. Sci. Symp, 1991, 632, 641 R. Cohen, R. Tamassia, Dynamic expression trees and their applications, Proceedings, 2nd Annual ACM-SIAM SODA, 1991 A. Gupta, I. S. Mumick, V. S. Subrahmanian, Maintaining Views Incrementally, Proceedings of the ACM SIGMOD, 1993, 157, 166 10.1006/jcss.1997.1520_SS971520RF7 Chandra (10.1006/jcss.1997.1520_SS971520RF5) 1982; 25 Tarjan (10.1006/jcss.1997.1520_SS971520RF34) 1979; 22 Ajtai (10.1006/jcss.1997.1520_SS971520RF1) 1983; 24 10.1006/jcss.1997.1520_SS971520RF4 10.1006/jcss.1997.1520_SS971520RF6 Immerman (10.1006/jcss.1997.1520_SS971520RF22) 1995; 116 Liu (10.1006/jcss.1997.1520_SS971520RF25) 1995; 24 Barrington (10.1006/jcss.1997.1520_SS971520RF3) 1989; 89–22 10.1006/jcss.1997.1520_SS971520RF10 10.1006/jcss.1997.1520_SS971520RF32 10.1006/jcss.1997.1520_SS971520RF11 10.1006/jcss.1997.1520_SS971520RF33 Lloyd (10.1006/jcss.1997.1520_SS971520RF26) 1987; 4 10.1006/jcss.1997.1520_SS971520RF31 10.1006/jcss.1997.1520_SS971520RF14 10.1006/jcss.1997.1520_SS971520RF15 10.1006/jcss.1997.1520_SS971520RF35 Immerman (10.1006/jcss.1997.1520_SS971520RF18) 1989; 38 10.1006/jcss.1997.1520_SS971520RF17 Immerman (10.1006/jcss.1997.1520_SS971520RF20) 1987; 16 Immerman (10.1006/jcss.1997.1520_SS971520RF21) 1981; 22 Dong (10.1006/jcss.1997.1520_SS971520RF8) 1995; 120 Furst (10.1006/jcss.1997.1520_SS971520RF16) 1984; 17 Dong (10.1006/jcss.1997.1520_SS971520RF9) 1992; 646 Fagin (10.1006/jcss.1997.1520_SS971520RF12) 1974; 7 Frederickson (10.1006/jcss.1997.1520_SS971520RF13) 1985; 14 Barrington (10.1006/jcss.1997.1520_SS971520RF2) 1989; 38 10.1006/jcss.1997.1520_SS971520RF23 10.1006/jcss.1997.1520_SS971520RF24 Miltersen (10.1006/jcss.1997.1520_SS971520RF29) 1994; 130 10.1006/jcss.1997.1520_SS971520RF27 10.1006/jcss.1997.1520_SS971520RF28 Nicolas (10.1006/jcss.1997.1520_SS971520RF30) 1982; 18 Immerman (10.1006/jcss.1997.1520_SS971520RF19) 1989; 18 |
| References_xml | – volume: 22 start-page: 606 year: 1979 end-page: 611 ident: SS971520RF34 article-title: Storing a sparse table publication-title: Commun. ACM – volume: 646 year: 1992 ident: SS971520RF9 article-title: First-order incremental evaluation of datalog queries publication-title: LNCS – reference: A. Gupta, I. S. Mumick, V. S. Subrahmanian, Maintaining Views Incrementally, Proceedings of the ACM SIGMOD, 1993, 157, 166 – reference: , IEEE Found. of Comput. Sci. Symp, 1991, 632, 641 – volume: 18 start-page: 625 year: 1989 end-page: 638 ident: SS971520RF19 article-title: Expressibility and parallel complexity publication-title: SIAM J. Comput. – volume: 24 start-page: 1 year: 1995 end-page: 39 ident: SS971520RF25 article-title: Systematic derivation of incremental programs publication-title: Sci. Comput. Programming – volume: 89–22 year: 1989 ident: SS971520RF3 publication-title: Technical Report – reference: H. Jakobsson, On materializing views and on-line queries, Proceedings, International Conference on Database Theory, Berlin, 1992, 407, 420 – volume: 17 start-page: 13 year: 1984 end-page: 27 ident: SS971520RF16 article-title: Parity, circuits, and the polynomial-time hierarchy publication-title: Math. Systems Theory – reference: P. B. Miltersen, The bit probe complexity measure revisited, Proceedings of the Tenth Symposium on Theorecital Aspects of Computer Science, 1993 – volume: 38 start-page: 150 year: 1989 end-page: 164 ident: SS971520RF2 article-title: Bounded-width polynomial-size branching programs recognize exactly those languages in NC publication-title: J. Comput. System Sci. – reference: G. F. Frederickson, Ambivalent data structures for dynamic 2-edge connectivity and – volume: 16 start-page: 760 year: 1987 end-page: 778 ident: SS971520RF20 article-title: Languages that capture complexity classes publication-title: SIAM J. Comput. – reference: Y. Ionanadis, A time bound on the materialization of some recursively defined views, Proceedings, International Conference on Very Large Data Bases, 1985 – volume: 4 start-page: 334 year: 1987 end-page: 343 ident: SS971520RF26 article-title: Integrity constraint checking in stratified databases publication-title: J. Logic Programming – reference: J. A. Medina, N. Immerman, A syntactic characterization of NP-completeness, IEEE Symp. Logic in Comput. Sci, 1994, 241, 250 – volume: 130 start-page: 203 year: 1994 end-page: 236 ident: SS971520RF29 article-title: Complexity models for incremental computation publication-title: Theoret. Comput. Sci. – reference: M. Rauch, 1994, Improved data structures for fully dynamic biconnectivity, ACM Symp. Theory of Comput. 686, 695 – volume: 7 year: 1974 ident: SS971520RF12 article-title: Generalized first-order spectra and polynomial-time recognizable sets publication-title: Complexity of Computation – reference: D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, Sparsification—A technique for speeding up dynamic graph algorithms, IEEE Found. Comput. Sci. Symp, 1992, 60, 69 – volume: 22 start-page: 65 year: 1981 end-page: 72 ident: SS971520RF21 article-title: Number of quantifiers is better than number of tape cells publication-title: J. Comput. System. Sci. – volume: 25 start-page: 99 year: 1982 end-page: 128 ident: SS971520RF5 article-title: Structure and complexity of relational queries publication-title: J. Comput. Systems Sci. – volume: 116 start-page: 103 year: 1995 end-page: 116 ident: SS971520RF22 article-title: The complexity of iterated multiplication publication-title: Inform. and Comput. – reference: S. Patnaik, N. Immerman, 1994, Dyn-FO: A parallel, dynamic complexity class, ACM Symp. Principles Database Systems, 210, 221 – volume: 38 start-page: 75 year: 1989 end-page: 91 ident: SS971520RF18 article-title: Descriptive and computational complexity publication-title: Computational Complexity Theory – reference: G. Ramalingam, T. Reps, 1993, A categorized bibliography on incremental computation, ACM Symp. Principles of Programming Languages, 502, 510 – reference: D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, Sparsification and planarity testing, Proceedings, ACM Symposium on Theory of Computing, 1992 – reference: R. Cohen, R. Tamassia, Dynamic expression trees and their applications, Proceedings, 2nd Annual ACM-SIAM SODA, 1991 – volume: 120 start-page: 101 year: 1995 end-page: 106 ident: SS971520RF8 article-title: Incremental and decremental evaluation of transitive closure by first-order queries publication-title: Inform. and Comput. – volume: 14 start-page: 781 year: 1985 end-page: 798 ident: SS971520RF13 article-title: Data structures for on-line updating of minimum spanning trees publication-title: SIAM J. Comput. – volume: 24 start-page: 1 year: 1983 end-page: 48 ident: SS971520RF1 article-title: formulae on finite structures publication-title: Ann. Pure Appl. Logic – reference: A. Borodin, R. Razborov, S. Smolensky, 1991, On lower bounds for read- – reference: S. Patnaik, 1994, The dynamic complexity of approximation, Computer Science Dept. University of Massachusetts – reference: G. Dong, J. Su, Space-bounded FOIES, ACM Symp. Principles Database Systems, 1995, 139, 150 – reference: M. Fredman, M. Saks, The cell probe complexity of dynamic data structures, 21 st ACM STOC Symp, 1989, 345, 354 – volume: 18 start-page: 227 year: 1982 end-page: 253 ident: SS971520RF30 article-title: Logic for improving integrity checking in relational databases publication-title: Acta Inform. – volume: 18 start-page: 227 year: 1982 ident: 10.1006/jcss.1997.1520_SS971520RF30 article-title: Logic for improving integrity checking in relational databases publication-title: Acta Inform. doi: 10.1007/BF00263192 – volume: 130 start-page: 203 year: 1994 ident: 10.1006/jcss.1997.1520_SS971520RF29 article-title: Complexity models for incremental computation publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(94)90159-7 – volume: 120 start-page: 101 year: 1995 ident: 10.1006/jcss.1997.1520_SS971520RF8 article-title: Incremental and decremental evaluation of transitive closure by first-order queries publication-title: Inform. and Comput. doi: 10.1006/inco.1995.1102 – ident: 10.1006/jcss.1997.1520_SS971520RF11 – volume: 18 start-page: 625 year: 1989 ident: 10.1006/jcss.1997.1520_SS971520RF19 article-title: Expressibility and parallel complexity publication-title: SIAM J. Comput. doi: 10.1137/0218043 – ident: 10.1006/jcss.1997.1520_SS971520RF7 doi: 10.1145/212433.220204 – volume: 25 start-page: 99 year: 1982 ident: 10.1006/jcss.1997.1520_SS971520RF5 article-title: Structure and complexity of relational queries publication-title: J. Comput. Systems Sci. doi: 10.1016/0022-0000(82)90012-5 – volume: 24 start-page: 1 year: 1995 ident: 10.1006/jcss.1997.1520_SS971520RF25 article-title: Systematic derivation of incremental programs publication-title: Sci. Comput. Programming doi: 10.1016/0167-6423(94)00031-9 – volume: 646 year: 1992 ident: 10.1006/jcss.1997.1520_SS971520RF9 article-title: First-order incremental evaluation of datalog queries publication-title: LNCS – ident: 10.1006/jcss.1997.1520_SS971520RF27 doi: 10.1109/LICS.1994.316065 – ident: 10.1006/jcss.1997.1520_SS971520RF33 doi: 10.1145/195058.195434 – ident: 10.1006/jcss.1997.1520_SS971520RF35 doi: 10.1145/158511.158710 – volume: 38 start-page: 150 year: 1989 ident: 10.1006/jcss.1997.1520_SS971520RF2 article-title: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 publication-title: J. Comput. System Sci. doi: 10.1016/0022-0000(89)90037-8 – ident: 10.1006/jcss.1997.1520_SS971520RF15 doi: 10.1145/73007.73040 – volume: 38 start-page: 75 year: 1989 ident: 10.1006/jcss.1997.1520_SS971520RF18 article-title: Descriptive and computational complexity – ident: 10.1006/jcss.1997.1520_SS971520RF32 doi: 10.1145/182591.182614 – ident: 10.1006/jcss.1997.1520_SS971520RF24 doi: 10.1007/3-540-56039-4_56 – volume: 16 start-page: 760 year: 1987 ident: 10.1006/jcss.1997.1520_SS971520RF20 article-title: Languages that capture complexity classes publication-title: SIAM J. Comput. doi: 10.1137/0216051 – volume: 4 start-page: 334 year: 1987 ident: 10.1006/jcss.1997.1520_SS971520RF26 article-title: Integrity constraint checking in stratified databases publication-title: J. Logic Programming doi: 10.1016/0743-1066(87)90009-4 – volume: 22 start-page: 606 year: 1979 ident: 10.1006/jcss.1997.1520_SS971520RF34 article-title: Storing a sparse table publication-title: Commun. ACM doi: 10.1145/359168.359175 – volume: 17 start-page: 13 year: 1984 ident: 10.1006/jcss.1997.1520_SS971520RF16 article-title: Parity, circuits, and the polynomial-time hierarchy publication-title: Math. Systems Theory doi: 10.1007/BF01744431 – ident: 10.1006/jcss.1997.1520_SS971520RF31 – ident: 10.1006/jcss.1997.1520_SS971520RF10 doi: 10.1109/SFCS.1992.267818 – volume: 89–22 year: 1989 ident: 10.1006/jcss.1997.1520_SS971520RF3 publication-title: Technical Report – volume: 7 year: 1974 ident: 10.1006/jcss.1997.1520_SS971520RF12 article-title: Generalized first-order spectra and polynomial-time recognizable sets – ident: 10.1006/jcss.1997.1520_SS971520RF28 doi: 10.1007/3-540-56503-5_65 – volume: 22 start-page: 65 year: 1981 ident: 10.1006/jcss.1997.1520_SS971520RF21 article-title: Number of quantifiers is better than number of tape cells publication-title: J. Comput. System. Sci. doi: 10.1016/0022-0000(81)90039-8 – volume: 116 start-page: 103 year: 1995 ident: 10.1006/jcss.1997.1520_SS971520RF22 article-title: The complexity of iterated multiplication publication-title: Inform. and Comput. doi: 10.1006/inco.1995.1007 – ident: 10.1006/jcss.1997.1520_SS971520RF14 doi: 10.1109/SFCS.1991.185429 – ident: 10.1006/jcss.1997.1520_SS971520RF4 – ident: 10.1006/jcss.1997.1520_SS971520RF6 – volume: 24 start-page: 1 year: 1983 ident: 10.1006/jcss.1997.1520_SS971520RF1 article-title: Σ11formulae on finite structures publication-title: Ann. Pure Appl. Logic doi: 10.1016/0168-0072(83)90038-6 – ident: 10.1006/jcss.1997.1520_SS971520RF17 doi: 10.1145/170035.170066 – volume: 14 start-page: 781 year: 1985 ident: 10.1006/jcss.1997.1520_SS971520RF13 article-title: Data structures for on-line updating of minimum spanning trees publication-title: SIAM J. Comput. doi: 10.1137/0214055 – ident: 10.1006/jcss.1997.1520_SS971520RF23 |
| SSID | ssj0011563 |
| Score | 1.7826334 |
| Snippet | Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP are defined in terms of the... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 199 |
| Title | Dyn-FO: A Parallel, Dynamic Complexity Class |
| URI | https://dx.doi.org/10.1006/jcss.1997.1520 https://www.proquest.com/docview/22813358 |
| Volume | 55 |
| WOSCitedRecordID | wos10_1006_jcss_1997_1520&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection - Elsevier customDbUrl: eissn: 1090-2724 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWLQc48ChUbSmQAxIHauE4L7u3FW1FUVX2UKS9WU7siIoqrXa3Vfn3nfEjaUErARKXaGU5WWlmMvNlPPMNIe9qw0vDhcGyCk1zwSStq0LTGsABK3VtjHbs-sfVyYmYzeR0NDqOvTDX51XXiZsbeflfVQ1roGxsnf0LdfcPhQX4DUqHK6gdrn-k-P2fHT386jvOp3qOs1Jcmnffz553HgBZMAF9u4mYK-BpE8Y9uNMFz_f8IYTLHoZP9bLTZz9Cdc93PdTQHGE-PCRXMc88JBccMWssUwsZr9j1cq8o03UAYKDzMcQ7TiYZ5ZXvh46e1RPwBgvid9xk6ocihYjLHUHC784cHAI682axwJ7KCkc1sSFs9cWEeN7MHdatJG4RD8gah88gNiZrk6OD2Zf-VAm-VbPIHo83RBJPVn68_y-rQMov4dphkNNn5EnQTjLxSn9ORrZbJ0_jYI4k-Ol18vgOy-QLsustYi-ZJNEedpNgDclgDYmzhpfk2-HB6afPNAzJoA1AvyVNTd42ouUyzS3S-QGirISxWZq1NZMmhZdOZJkueCsKDeCzrYXM01bnTJe6MmW2QcbdRWc3SWLLxgpYFXle5JppWbS50cxUZVHL2vItQqNUVBMY5HGQybny3NelQikqlKJCKW6R9_3-S8-dsnJnGoWsgil7RKfAFlbe8zZqQ4FLxHMu3dmLq4XiXKRZVojtf3jqK_JoeA92yHg5v7KvycPmenm2mL8JBnUL3YeCkg |
| linkProvider | Elsevier |
| 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=Dyn-FO%3A+A+Parallel%2C+Dynamic+Complexity+Class&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Patnaik%2C+Sushant&rft.au=Immerman%2C+Neil&rft.date=1997-10-01&rft.pub=Elsevier+Inc&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=55&rft.issue=2&rft.spage=199&rft.epage=209&rft_id=info:doi/10.1006%2Fjcss.1997.1520&rft.externalDocID=S0022000097915208 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |