Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Using (3+1)-ary Input Relations
暂无分享,去创建一个
[1] D. M. Barrington. A Note on a Theorem of Razborov , 1987 .
[2] Jianwen Su,et al. Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries , 1995, Inf. Comput..
[3] Jianwen Su,et al. Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries , 1998, J. Comput. Syst. Sci..
[4] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[5] Neil Immerman,et al. Dyn-FO: A Parallel, Dynamic Complexity Class , 1997, J. Comput. Syst. Sci..
[6] Inderpal Singh Mumick,et al. Incremental Evaluation Of Datalog Queries , 1999 .
[7] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[8] Jin-Yi Cai. Lower bounds for constant depth circuits in the presence of help bits , 1989, 30th Annual Symposium on Foundations of Computer Science.