A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Dyn-FO: A Parallel, Dynamic Complexity Class
1997
Journal of computer and system sciences (Print)
Preserved Fulltext
We d e v elop a theory of Dynamic Complexity. W e study the new complexity class, Dynamic First-Order Logic (Dyn-FO). ...
Furthermore, we s h o w t h a t a version of REACH a , c a l l e d REACH a + , is not in Dyn-FO unless all of P is contained in parallel linear time. ...
Conclusions We h a ve de ned dynamic complexity classes, and their reductions. In particular, we h a ve begun an investigation of the rich dynamic complexity class Dyn-FO. ...
doi:10.1006/jcss.1997.1520
fatcat:qplyl4bxebg4dazyzfvlx42xxa
Page 2758 of Mathematical Reviews Vol. , Issue 99d
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We develop a theory of dynamic complexity. We study the new complexity class, dynamic first-order logic (Dyn-FO). ...
Colbourn (1-VT-C; Burlington, VT)
99d:68086 68Q15 68P15 Patnaik, Sushant (1-MA-C; Amherst, MA); Immerman, Neil (1-MA-C; Amherst, MA) Dyn-FO: a parallel, dynamic complexity class. ...
Page 5237 of Mathematical Reviews Vol. , Issue 98H
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
{A collection containing selected am from the 12th Symposium has been reviewed [MR 97c:68003]. }
Contents: Sushant Patnaik and Neil Immerman, Dyn-FO: a parallel, dynamic complexity class (199-209); Foto ...
query language for NC (299-321); Dan Suciu and Jan Paredaens, The complex- ity of the evaluation of complex algebra expressions (322-343); V. ...
View maintenance issues for the chronicle data model (extended abstract)
1995
Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Dyn-
fo:
A parallel,
dynamic
complexity
class.
In
Proceedings
of the Thirteenth
Symposium
on
Principles
of Database Systems (PODS),
pages
210-221,
1994.
X. Qian. ...
We focus
on incremental
complexity
classes that
are more
efficient
than
Dyn-
FO, and we exploit
the special
properties
of a chronicle
to make the incremental
complexity
independent
of ...
doi:10.1145/212433.220201
dblp:conf/pods/JagadishMS95
fatcat:453arxesljc6hnv34ka6uykivm
Complete problems for dynamic complexity classes
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (polynomially bounded) SQL ...
The first problem we show complete for Dyn-FO is a singlestep version of the circuit value problem (SSCV). ...
In [PI97] the complexity class, Dynamic First-Order Logic (Dyn-FO) was studied. ...
doi:10.1109/lics.2002.1029839
dblp:conf/lics/HesseI02
fatcat:gcowxuoujrah3eilus4ane7i6e
Dynamic Complexity Meets Parameterised Algorithms
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. ...
The resulting classes are compared with their non-dynamic counterparts and other classes. ...
Dyn-FO: A Parallel, Dynamic Complexity Class. J. Thomas Schwentick and Thomas Zeume. Dynamic Complexity: Recent Updates. Inf. ...
arXiv:1910.06281v2
fatcat:kqxvs46ed5cblkuj2liutee2m4
Dynamic Complexity of Parity Games with Bounded Tree-Width
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. ...
We study the dynamic complexity of two-player parity games over graphs of bounded tree-width, where updates may add or delete edges, or change the owner or color of states. ...
Dyn-FO: A parallel, dynamic complexity class.
Journal of Computer and System Sciences, 55(2):199–209, October 1997.
20 Neil Robertson and Paul D. Seymour. ...
arXiv:1610.00571v1
fatcat:mio2humrhzanfebb6c5kk4kmzq
Incremental Validation of XML Documents
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We exhibit a restricted class of DTDs called "local" that arise commonly in practice and for which incremental validation can be done in practically constant time by maintaining only a list of counters ...
This is a significant improvement over brute-force re-validation from scratch. ...
ACKNOWLEDGMENTS We would like to thank Byron Choi for providing us a collection of DTDs and the source code of the DTD Inquisitor tool used in [Choi 2002 ]. ...
doi:10.1007/3-540-36285-1_4
fatcat:eiadxsl4wjbuzke6727p3nodbq
Incremental validation of XML documents
2004
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We exhibit a restricted class of DTDs called "local" that arise commonly in practice and for which incremental validation can be done in practically constant time by maintaining only a list of counters ...
This is a significant improvement over brute-force re-validation from scratch. ...
ACKNOWLEDGMENTS We would like to thank Byron Choi for providing us a collection of DTDs and the source code of the DTD Inquisitor tool used in [Choi 2002 ]. ...
doi:10.1145/1042046.1042050
fatcat:ij36dgpvejcolkujvhauvxpiwa
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
2005
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
For transitive closure, the algorithm is applicable to a more general class of graphs than those previously explored. ...
Our algorithms use first-order queries, along with addition (+) and less-than (<) operations (F O(+, <)); they store O(n 2 ) number of tuples, where n is the number of vertices, and have AC 0 data complexity ...
The mechanism used in this approach is called a "First-Order Incremental Evaluation System" in [Dong and Topor 1992] and "Dyn-FO" in [Patnaik and Immerman 1994] . ...
doi:10.1145/1093382.1093384
fatcat:i7nkug5sqjaenk3olzh4vytlde
Page 1611 of Mathematical Reviews Vol. 31, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
F.; et al., 99c:68100
Parkins, Keith see Hemaspaandra, Lane A.; et al., 99f:68072
Patnaik, Sushant (with Immerman, Neil) Dyn-FO: a parallel, dynamic complexity class. ...
., 99d:68077b
Szepietowski, Andrzej Weak and strong one-way space complexity classes. ...
Page 1339 of Mathematical Reviews Vol. 31, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(Josef Dalik) 99a:65157 65N30 (65N12)
Patnaik, Sushant (with Immerman, Neil) Dyn-FO: a parallel, dynamic complexity class. ...
Free oscillations of water in a circular lake and the H-function of several complex variables with a general class of polynomials. (English summary) Acta Cienc. ...
Incremental FO( +, < ) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our algorithms use rst-order queries, + (addition) and < (less-than); they store O(n 2 ) number of tuples, where n is the number of vertices, and have AC 0 data complexity for integer weights. ...
The mechanism used in this approach is called a \First-Order Incremental Evaluation System" in 7] and \Dyn-FO" in 14] . ...
Our algorithms have a low parallel complexity and make additional optimizations possible (e.g., the optimization techniques in relational database). ...
doi:10.1007/3-540-49257-7_23
fatcat:rdhgr5cvdbeqxaiaqefljse6be
Bounded-Memory Criteria for Streams with Application Time
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In classical OBDA, a high-level query is answered by transforming it into a query on data source level. ...
In particular it is difficult to decide whether a query can be answered in bounded memory, i.e., in constant space w.r.t. an infinitely growing prefix of a data stream. ...
A stream-temporal query language for ontology based data access. In KI 2014, volume 8736 of LNCS, 183-194. Springer. Patnaik, S., and Immerman, N. 1997. Dyn-fo: A parallel, dynamic complexity class. ...
arXiv:2007.16040v1
fatcat:2exccfdydvbxbnb5avez5qlwem
Maintenance of datalog materialisations revisited
2019
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
., precompute and store) all facts entailed by a datalog program and a set of explicit facts. ...
Datalog is a rule-based formalism that can axiomatise recursive properties such as reachability and transitive closure. ...
Patnaik and Immerman [48] proposed the Dyn-FO class of problems where, for a constant-sized change in the input, the change to the output can be computed by evaluating first-order maintenance queries ...
doi:10.1016/j.artint.2018.12.004
fatcat:t7ghbfqkjjf4dnn44ljdxfef7y
« Previous
Showing results 1 — 15 out of 16 results