Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences (Q5200101): 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 / author
 
Property / author: Juraj Wiedermann / rank
Normal rank
 
Property / author
 
Property / author: Juraj Wiedermann / 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/978-3-642-22600-7_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W184826316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time- and tape-bounded Turing acceptors and AFLs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of One-Tape Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape bounds for time-bounded Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5192993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218136 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:11, 4 July 2024

scientific article; zbMATH DE number 5934425
Language Label Description Also known as
English
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences
scientific article; zbMATH DE number 5934425

    Statements