Complexity and Expressive Power of Deterministic Semantics for DATALOG^¬

ISSN： 0890-5401

Source： Information and Computation, Vol.153, Iss.1, 1999-08, pp. : 81-98

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The complexity space of partial functions: a connection between complexity analysis and denotational semantics

By Romaguera S.

International Journal of Computer Mathematics, Vol. 88, Iss. 9, 2011-06 ,pp. : 1819-1829

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Generating Power of Total Deterministic Tree Transducers

By Maneth S.

Information and Computation, Vol. 147, Iss. 2, 1998-12 ,pp. : 111-144

Academic Press

Access to resources Recommend Favorite

Inference of monotonicity constraints in Datalog programs

By Brodsky A.

Annals of Mathematics and Artificial Intelligence, Vol. 26, Iss. 1-4, 1999-01 ,pp. : 29-57

Springer Publishing Company

Access to resources Recommend Favorite

Complexity Theory and Genetics: The Computational Power of Crossing Over

By Pudlák P.

Information and Computation, Vol. 171, Iss. 2, 2001-12 ,pp. : 201-223

Academic Press

Access to resources Recommend Favorite

The complexity of VLSI power-delay optimization by interconnect resizing

By Moiseev Konstantin

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 292-300

Springer Publishing Company

Access to resources Recommend Favorite