The Complexity Space of Partial Functions: A Connection Between Complexity Analysis and Denotational Semantics

International Journal of Computer Mathematics - United Kingdom
doi 10.1080/00207161003631885
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Informa UK Limited

Related search

Connection Between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics

DAIMI Report Series
1978English

Semantics and Complexity of SPARQL

ACM Transactions on Database Systems
Information Systems
2009English

The Complexity of Partial Orders

2012English

Towards Measuring the Complexity of Introducing Semantics Into a Company

2013English

A Denotational Semantics for the Π-Calculus

2001English

The Complexity of Real Recursive Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

The Monotone Circuit Complexity of Boolean Functions

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1987English

Complexity of the Class of Peano Functions

Colloquium Mathematicum
Mathematics
2000English

Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy