May 30, 2009 · A number of theories have been developed to characterize ALogTime (or uniform NC 1, or just NC 1), the class of languages accepted by ...

The class ALogTime consists of languages computable by alternating Tur- ing machines (with random access to inputs) in time logarithmic of ...

A number of theories have been developed to characterize ALogTime (or uniform NC 1, or just NC 1), the class of languages accepted by alternating logtime ...

A number of theories have been developed to characterize ALogTime (or uniform NC 1, or just NC 1), the class of languages accepted by alternating logtime ...

Bibliographic details on The equivalence of theories that characterize ALogTime.

Nov 28, 2024 · Phuong Nguyen: The equivalence of theories that characterize ALogTime. Arch. Math. Log ...

Nov 26, 2013 · The Equivalence of Theories that Characterize ALogTime. [pdf file] ... Characterizing polynomial time computable functions using theories with weak ...

[해외논문] The equivalence of theories that characterize ALogTime. Archive for mathematical logic, v.48 no.6, 2009년, pp.523 - 549. Nguyen, Phuong. 내보내기

The equivalence of theories that characterize ALogTime. Phuong Nguyen. OriginalPaper 30 May 2009 Pages: 523 - 549. Deep sequent systems for modal logic. Kai ...

... The equivalence of theories that characterize ALogTime. Archive for Mathematical Logic 48 (6): 523-549. 2009. A number of theories have been developed to ...