Identifying polynomial-time recursive functions

Authors:
Carsten Schürmann;Jatin Shah
Affiliations:
Department of Computer Science, Yale University, New Haven;Department of Computer Science, Yale University, New Haven
Venue:
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Year:
2005

Citing 8
Cited 1

A new recursion-theoretic characterization of the polytime functions (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
General Techniques for Analyzing Recursive Algorithms with Applications

SIAM Journal on Computing
Polynomial-time computation via local inference relations

ACM Transactions on Computational Logic (TOCL)
Mode and Termination Checking for Higher-Order Logic Programs

ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
A New Meta-complexity Theorem for Bottom-Up Logic Programs

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Linear types and non-size-increasing polynomial time computation

Information and Computation - Special issue: ICC '99
Representing reductions of NP-complete problems in logical frameworks: a case study

MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding

A formalization of polytime functions

ITP'11 Proceedings of the Second international conference on Interactive theorem proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a sound and sufficient criterion for identifying polynomial-time recursive functions over higher-order data structures generalizing the seminal results by Bellantoni and Cook [1] and Leivant [2] to complex structural data-types. The criterion, presented as a deductive system, always terminates with a response that is either yes or don't know. The criterion is complete in the sense that every polynomial-time recursive function over binary strings has at least one implementation that is identified by our criterion; whether this is also true for arbitrary higher-order data structures remains an open problem. Logic programming serves as the underlying model of computation and our results apply to the Horn fragment as well to the fragment of hereditary Harrop formulas.