A taxonomy of problems with fast parallel algorithms
Information and Control
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Function-algebraic characterizations of log and polylog parallel time
Computational Complexity
Journal of the ACM (JACM)
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
A characterization of alternating log time by ramified recurrence
Theoretical Computer Science - Trees in algebra and programming
Programming languages capturing complexity classes
ACM SIGACT News
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computational Models and Function Algebras
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
A Characterization of NC by Tree Recurrence
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
SIAM Journal on Computing
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Resource bound certification for a tail-recursive virtual machine
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Resource analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Towards an implicit characterization of NCk
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The flow of data and the complexity of algorithms
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A characterization of NCk by first order functional programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Quasi-interpretations a way to control resources
Theoretical Computer Science
| Hi-index | 0.00 |
We a give an intrinsic characterization of the class of functions which are computable in NC1 that is by a uniform, logarithmic depth and polynomial size family circuit. Recall that the class of functions in ALogTime, that is in logarithmic time on an Alternating Turing Machine, is NC1. Our characterization is in terms of first order functional programming languages. We define measure-tools called Sup-interpretations, which allow to give space and time bounds and allow also to capture a lot of program schemas. This study is part of a research on static analysis in order to predict program resources. It is related to the notion of Quasi-interpretations and belongs to the implicit computational complexity line of research.