The equivalence of theories that characterize ALogTime (Q834715): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Roman Murawski / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Roman Murawski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00153-009-0136-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084344766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded arithmetic AID for Frege systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALOGTIME and a conjecture of S. A. Cook / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic for NC, ALogTIME, L and NL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentiation and second-order bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories for TC0 and Other Small Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on polynomially bounded arithmetic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:34, 1 July 2024

scientific article
Language Label Description Also known as
English
The equivalence of theories that characterize ALogTime
scientific article

    Statements

    The equivalence of theories that characterize ALogTime (English)
    0 references
    0 references
    27 August 2009
    0 references
    The paper is devoted to theories characterizing the class ALogTime consisting of languages computable by alternating Turing machines. Most attention is paid to Clote's theory ALV\('\). It is shown that ALV\('\) is equivalent to other theories charactyerizing ALogTime, in particular to ALV, T\(^{0}\)NC\(^{0}\), AID + \(\Sigma ^{B}_{0}\)-CA and its two-sorted version VNC\(^{1}\).
    0 references
    0 references
    0 references