Reversal complexity revisited (Q935164): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.04.026 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3996675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for randomized read/write stream algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-depth, polynomial-size circuits for symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for query processing on streaming and external memory data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressibility and Parallel Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between deterministic time and deterministic reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for memory hierarchies. Advanced lectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounds in Communication Complexity Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on nondeterminism in small, fast parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707407 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.04.026 / rank
 
Normal rank

Latest revision as of 08:50, 10 December 2024

scientific article
Language Label Description Also known as
English
Reversal complexity revisited
scientific article

    Statements

    Reversal complexity revisited (English)
    0 references
    0 references
    0 references
    31 July 2008
    0 references
    reversal-bounded and space-bounded Turing machines
    0 references
    hierarchies of complexity classes
    0 references

    Identifiers