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

[PDF] acm.org

Cut and paste

P Atzeni, G Mecca - Proceedings of the sixteenth ACM SIGACT-SIGMOD …, 1997 - dl.acm.org
The paper develops EDITOR, a language for manipulating semi-structured documents, such
as the ones typically avai-lable on the Web. EDITOR programs allow to search and …
被引用次数：173 相关文章 所有 5 个版本
[PDF] sciencedirect.com

Sequences, datalog, and transducers

A Bonner, G Mecca - Journal of Computer and System Sciences, 1998 - Elsevier
This paper develops a query language for sequence databases, such as genome databases
and text databases. The language, calledSequence Datalog, extends classical Datalog with …
被引用次数：32 相关文章 所有 6 个版本
[PDF] sciencedirect.com

Cut and paste

G Mecca, P Atzeni - Journal of Computer and System Sciences, 1999 - Elsevier
The paper develops Editor, a language for manipulating semistructured documents, such as
those typically available on the Web. Editor programs are based on two simple ideas, taken …
被引用次数：40 相关文章 所有 7 个版本

Safe Turing machines, Grzegorczyk classes and Polytime

S Caporaso - International Journal of Foundations of Computer …, 1996 - World Scientific
We introduce a class of safe Turing machines which execute structured while, if-then-else
programs and operate on stacks and on a read-only input tape. A hierarchy is obtained by …
被引用次数：8 相关文章 所有 4 个版本

On a relation between uniform coding and problems of the form DTIMEF ()=? DSPACEF

S Caporaso, M Zito - Acta informatica, 1998 - Springer
If uniform coding (Gödelization) of potentially infinite sequences of numbers can be
performed in PSPACEF, then PSPACE= EXPTIME ≠ EXPSPACE= 2-EXPTIME, and, for all …
被引用次数：6 相关文章 所有 10 个版本
[PDF] sciencedirect.com

A predicative and decidable characterization of the polynomial classes of languages

S Caporaso, M Zito, N Galesi - Theoretical computer science, 2001 - Elsevier
Characterizations of PTIME, PSPACE, the polynomial hierarchy and its elements are given,
which are decidable (membership can be decided by syntactic inspection to the …
被引用次数：5 相关文章 所有 12 个版本
[PDF] psu.edu

Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy

S Caporaso, M Zito, N Galesi, E Covino - … , CIAC'97 Rome, Italy, March 12 …, 1997 - Springer
The definition of a class C of functions is syntactic if membership to C can be decided from
the construction of its elements. Syntactic characterizations of PTIMEF, of PSPACEF, of the …
被引用次数：5 相关文章 所有 9 个版本
[PDF] psu.edu

[PDF][PDF] On a relation between uniform coding and problems of the

S Caporaso, M Zito12 - Citeseer
If uniform coding (Gödelization) of potentially infinite sequences of numbers can be
performed in PSPACEF, then PSPACE= EXPTIME= EXPSPACE= 2-EXPTIME, and, for all p …
相关文章 所有 3 个版本

Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy

G Bongiovanni, DP Bovet… - ALGORITHMS AND …, 1997 - wrap.warwick.ac.uk
The definition of a class C of functions is syntactic if membership to C can be decided from
the construction of its elements. Syntactic characterizations of PTIMEF, of PSPACEF, of the …
相关文章 所有 2 个版本

Syntactic Characterization in Lisp of the Polynomial Complexity Classes and Hierarchy

MZ Salvatore Caporaso, N Galesi… - … and Complexity: Third …, 1997 - books.google.com
The definition of a class C of functions is syntactic if membership to C can be decided from
the construction of its elements. Syntactic characterizations of PTIMEF, of PSPACEF, of the …
相关文章