Reversal complexity revisited

We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r ( n ) , there are several further tapes on which head reversals remain unrestricted, but size is bounded by s ( n ) (where n denotes the input leng...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 401; číslo 1; s. 191 - 205
Hlavní autoři:	Hernich, André, Schweikardt, Nicole
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 23.07.2008 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Computer science; control theory; systems Data processing. List processing. Character string processing Exact sciences and technology Hierarchies of complexity classes Memory organisation. Data processing Miscellaneous Reversal-bounded and space-bounded Turing machines Software Theoretical computing Reversal-bounded and space-bounded Turing machines Hierarchies of complexity classes Lower bound Complexity class Evaluation Computer theory Query Memory Turing machine Resource Space time Circuit complexity AND circuit Sorting Trade Hierarchy Input Turing machines Query processing Computer Reversal-bounded and space-bounded Formalization
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r ( n ) , there are several further tapes on which head reversals remain unrestricted, but size is bounded by s ( n ) (where n denotes the input length). Recently [M. Grohe, C. Koch, N. Schweikardt, Tight lower bounds for query processing on streaming and external memory data, Theoretical Computer Science 380 (1–2) (2007) 199–217; M. Grohe, N. Schweikardt, Lower bounds for sorting with few random accesses to external memory, in: Proc. PODS’05, ACM Press, 2005, pp. 238–249], such machines were introduced as a formalization of a computation model that restricts random access to external memory and internal memory space. Here, each of the tapes with a restriction on the head reversals corresponds to an external memory device, and the tapes of restricted size model internal memory. We use ST ( r ( n ) , s ( n ) , O ( 1 ) ) to denote the class of all problems that can be solved by deterministic Turing machines that comply to the above resource bounds. Similarly, NST ( ⋯ ) and RST ( ⋯ ) , respectively, are used for the corresponding nondeterministic and randomized classes. While previous papers focused on lower bounds for particular problems, including sorting, the set equality problem, and several query evaluation problems, the present paper addresses the relations between the (R,N) ST ( ⋯ ) -classes and classical complexity classes and investigates the structural complexity of the (R,N) ST ( ⋯ ) -classes. Our main results are (1) a trade-off between internal memory space and external memory head reversals, (2) correspondences between the (R,N) ST ( ⋯ ) classes and “classical” time-bounded, space-bounded, reversal-bounded, and circuit complexity classes, and (3) hierarchies of (R) ST ( ⋯ ) -classes in terms of increasing numbers of head reversals on external memory tapes.
AbstractList	We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r ( n ) , there are several further tapes on which head reversals remain unrestricted, but size is bounded by s ( n ) (where n denotes the input length). Recently [M. Grohe, C. Koch, N. Schweikardt, Tight lower bounds for query processing on streaming and external memory data, Theoretical Computer Science 380 (1–2) (2007) 199–217; M. Grohe, N. Schweikardt, Lower bounds for sorting with few random accesses to external memory, in: Proc. PODS’05, ACM Press, 2005, pp. 238–249], such machines were introduced as a formalization of a computation model that restricts random access to external memory and internal memory space. Here, each of the tapes with a restriction on the head reversals corresponds to an external memory device, and the tapes of restricted size model internal memory. We use ST ( r ( n ) , s ( n ) , O ( 1 ) ) to denote the class of all problems that can be solved by deterministic Turing machines that comply to the above resource bounds. Similarly, NST ( ⋯ ) and RST ( ⋯ ) , respectively, are used for the corresponding nondeterministic and randomized classes. While previous papers focused on lower bounds for particular problems, including sorting, the set equality problem, and several query evaluation problems, the present paper addresses the relations between the (R,N) ST ( ⋯ ) -classes and classical complexity classes and investigates the structural complexity of the (R,N) ST ( ⋯ ) -classes. Our main results are (1) a trade-off between internal memory space and external memory head reversals, (2) correspondences between the (R,N) ST ( ⋯ ) classes and “classical” time-bounded, space-bounded, reversal-bounded, and circuit complexity classes, and (3) hierarchies of (R) ST ( ⋯ ) -classes in terms of increasing numbers of head reversals on external memory tapes.
Author	Schweikardt, Nicole Hernich, André
Author_xml	– sequence: 1 givenname: André surname: Hernich fullname: Hernich, André email: hernich@informatik.uni-frankfurt.de – sequence: 2 givenname: Nicole surname: Schweikardt fullname: Schweikardt, Nicole email: schweika@informatik.uni-frankfurt.de
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20488498$$DView record in Pascal Francis
BookMark	eNp9kE1LAzEQQINUsK3-AA9CLx53zdduEjxJ8QsKgug5xMkEUra7JQnF_nu3VDx46Fzm8t7AvBmZ9EOPhFwzWjPK2rt1XSDXnFJdU1lT3p6RKdPKVJwbOSFTKqishFHNBZnlvKbjNKqdkpt33GHKrlvAsNl2-B3LfpFwF3Ms6C_JeXBdxqvfPSefT48fy5dq9fb8unxYVSC4KpWmLijnAwjFGTfQmiCg0do1TKBsdeDahAY9GPSOIxquvMRG8C_gyB2IObk93t26DK4LyfUQs92muHFpbzmVWkujR44dOUhDzgnDH8KoPXSwazt2sIcOlko7dhgd9c-BWFyJQ1-Si91J8_5o4vj6LmKyGSL2gD4mhGL9EE_YP6fSeac
CODEN	TCSCDI
CitedBy_id	crossref_primary_10_1145_1516512_1516514 crossref_primary_10_1145_1815918_1815922
Cites_doi	10.1137/0222016 10.1109/SFCS.1979.29 10.1145/384192.384193 10.1016/S0022-0000(70)80006-X 10.1016/j.tcs.2007.02.062 10.1016/0020-0190(93)90016-3 10.1016/0304-3975(85)90045-3 10.1137/0218043 10.1137/0220039 10.1016/0020-0190(87)90112-8 10.1109/12.24282
ContentType	Journal Article
Copyright	2008 Elsevier B.V. 2008 INIST-CNRS
Copyright_xml	– notice: 2008 Elsevier B.V. – notice: 2008 INIST-CNRS
DBID	6I. AAFTH AAYXX CITATION IQODW
DOI	10.1016/j.tcs.2008.04.026
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science Applied Sciences
EISSN	1879-2294
EndPage	205
ExternalDocumentID	20488498 10_1016_j_tcs_2008_04_026 S0304397508003071
GroupedDBID	--K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ XJT YNT ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH
ID	FETCH-LOGICAL-c327t-80af7adfc372129c69f3c588a513e468f289f5edc9eda2ee927d4e532bc2e2ac3
ISICitedReferencesCount	7
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258203300018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0304-3975
IngestDate	Mon Jul 21 09:17:55 EDT 2025 Tue Nov 18 22:29:09 EST 2025 Sat Nov 29 05:14:56 EST 2025 Fri Feb 23 02:16:40 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Reversal-bounded and space-bounded Turing machines Hierarchies of complexity classes Lower bound Complexity class Evaluation Computer theory Query Memory Turing machine Resource Space time Circuit complexity AND circuit Sorting Trade Hierarchy Input Turing machines Query processing Computer Reversal-bounded and space-bounded Formalization
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c327t-80af7adfc372129c69f3c588a513e468f289f5edc9eda2ee927d4e532bc2e2ac3
OpenAccessLink	https://dx.doi.org/10.1016/j.tcs.2008.04.026
PageCount	15
ParticipantIDs	pascalfrancis_primary_20488498 crossref_primary_10_1016_j_tcs_2008_04_026 crossref_citationtrail_10_1016_j_tcs_2008_04_026 elsevier_sciencedirect_doi_10_1016_j_tcs_2008_04_026
PublicationCentury	2000
PublicationDate	2008-07-23
PublicationDateYYYYMMDD	2008-07-23
PublicationDate_xml	– month: 07 year: 2008 text: 2008-07-23 day: 23
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Theoretical computer science
PublicationYear	2008
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	Grohe, Hernich, Schweikardt (b7) 2006 Immerman (b12) 1998 A. Durand, C. Lautemann, M. More, Counting results in weak formalisms, Technical Report 1998-14, Université de Caen, France, 1998 Vitter (b22) 2001; 33 Grohe, Koch, Schweikardt (b8) 2005; vol. 3623 (b14) 2003; vol. 2625 Savitch (b20) 1970; 4 Chen, Yap (b4) 1991; 20 Balcázar, Díaz, Gabarró (b1) 1990 Papadimitriou (b16) 1994 Yao (b24) 1979 Grohe, Koch, Schweikardt (b9) 2007; 380 N. Pippenger, On simultaneous resource bounds, in: Proc. FOCS’79, 1979, pp. 307–311 Schweikardt (b21) 2005 Parberry (b17) 1987; 24 Wagner, Wechsung (b23) 1986 Balcázar, Díaz, Gabarró (b2) 1995 Fagin, Klawe, Pippenger, Stockmeyer (b6) 1985; 36 Immerman (b11) 1989; 18 Parberry (b18) 1989; 38 Grohe, Schweikardt (b10) 2005 Nisan, Wigderson (b15) 1993; 22 Beame, Jayram, Rudra (b3) 2007 Liśkiewicz (b13) 1993; 45 Yao (10.1016/j.tcs.2008.04.026_b24) 1979 Fagin (10.1016/j.tcs.2008.04.026_b6) 1985; 36 Vitter (10.1016/j.tcs.2008.04.026_b22) 2001; 33 Grohe (10.1016/j.tcs.2008.04.026_b9) 2007; 380 Grohe (10.1016/j.tcs.2008.04.026_b7) 2006 Beame (10.1016/j.tcs.2008.04.026_b3) 2007 Savitch (10.1016/j.tcs.2008.04.026_b20) 1970; 4 Balcázar (10.1016/j.tcs.2008.04.026_b1) 1990 Immerman (10.1016/j.tcs.2008.04.026_b12) 1998 Immerman (10.1016/j.tcs.2008.04.026_b11) 1989; 18 (10.1016/j.tcs.2008.04.026_b14) 2003; vol. 2625 Grohe (10.1016/j.tcs.2008.04.026_b8) 2005; vol. 3623 Grohe (10.1016/j.tcs.2008.04.026_b10) 2005 Wagner (10.1016/j.tcs.2008.04.026_b23) 1986 Nisan (10.1016/j.tcs.2008.04.026_b15) 1993; 22 Chen (10.1016/j.tcs.2008.04.026_b4) 1991; 20 10.1016/j.tcs.2008.04.026_b5 Parberry (10.1016/j.tcs.2008.04.026_b18) 1989; 38 Liśkiewicz (10.1016/j.tcs.2008.04.026_b13) 1993; 45 Papadimitriou (10.1016/j.tcs.2008.04.026_b16) 1994 Schweikardt (10.1016/j.tcs.2008.04.026_b21) 2005 Balcázar (10.1016/j.tcs.2008.04.026_b2) 1995 Parberry (10.1016/j.tcs.2008.04.026_b17) 1987; 24 10.1016/j.tcs.2008.04.026_b19
References_xml	– start-page: 41 year: 2005 end-page: 52 ident: b21 article-title: Machine models and lower bounds for query processing publication-title: Proc. PODS’07 – year: 1986 ident: b23 article-title: Computational Complexity – start-page: 689 year: 2007 end-page: 698 ident: b3 article-title: Lower bounds for randomized read/write stream algorithms publication-title: Proc. STOC’07 – reference: A. Durand, C. Lautemann, M. More, Counting results in weak formalisms, Technical Report 1998-14, Université de Caen, France, 1998 – volume: 4 start-page: 177 year: 1970 end-page: 192 ident: b20 article-title: Relationships between nondeterministic and deterministic tape complexities publication-title: Journal of Computer and Systems Sciences – year: 1995 ident: b2 article-title: Structural Complexity I – volume: vol. 3623 start-page: 1 year: 2005 end-page: 16 ident: b8 article-title: The complexity of querying external memory and streaming data publication-title: Proc. FCT’05 – reference: N. Pippenger, On simultaneous resource bounds, in: Proc. FOCS’79, 1979, pp. 307–311 – start-page: 238 year: 2005 end-page: 249 ident: b10 article-title: Lower bounds for sorting with few random accesses to external memory publication-title: Proc. PODS’05 – volume: 22 start-page: 211 year: 1993 end-page: 219 ident: b15 article-title: Rounds in communication complexity revisited publication-title: SIAM Journal on Computing – start-page: 243 year: 2006 end-page: 252 ident: b7 article-title: Randomized computations on large data sets: Tight lower bounds publication-title: Proc. PODS’06 – volume: 380 start-page: 199 year: 2007 end-page: 217 ident: b9 article-title: Tight lower bounds for query processing on streaming and external memory data publication-title: Theoretical Computer Science – volume: 20 start-page: 622 year: 1991 end-page: 638 ident: b4 article-title: Reversal complexity publication-title: SIAM Journal on Computing – year: 1994 ident: b16 article-title: Computational Complexity – volume: 38 start-page: 766 year: 1989 end-page: 767 ident: b18 article-title: A note on nondeterminism in small, fast parallel computers publication-title: IEEE Transactions on Computers – start-page: 209 year: 1979 end-page: 213 ident: b24 article-title: Some complexity questions related to distributive computing publication-title: Proc. STOC’79 – volume: 33 start-page: 209 year: 2001 end-page: 271 ident: b22 article-title: External memory algorithms and data structures: Dealing with massive data publication-title: ACM Computing Surveys – volume: 36 start-page: 239 year: 1985 end-page: 250 ident: b6 article-title: Bounded depth, polynomial size circuits for symmetric functions publication-title: Theoretical Computer Science – volume: vol. 2625 year: 2003 ident: b14 publication-title: Algorithms for Memory Hierarchies – year: 1990 ident: b1 article-title: Structural Complexity II – volume: 18 start-page: 625 year: 1989 end-page: 638 ident: b11 article-title: Expressibility and parallel complexity publication-title: SIAM Journal on Computing – volume: 45 start-page: 143 year: 1993 end-page: 146 ident: b13 article-title: On the relationship between deterministic time and deterministic reversal publication-title: Information Processing Letters – volume: 24 start-page: 363 year: 1987 end-page: 367 ident: b17 article-title: An improved simulation of space and reversal bounded deterministic turing machines by width and depth bounded uniform circuits publication-title: Information Processing Letters – year: 1998 ident: b12 article-title: Descriptive Complexity – volume: vol. 3623 start-page: 1 year: 2005 ident: 10.1016/j.tcs.2008.04.026_b8 article-title: The complexity of querying external memory and streaming data – volume: 22 start-page: 211 issue: 1 year: 1993 ident: 10.1016/j.tcs.2008.04.026_b15 article-title: Rounds in communication complexity revisited publication-title: SIAM Journal on Computing doi: 10.1137/0222016 – ident: 10.1016/j.tcs.2008.04.026_b19 doi: 10.1109/SFCS.1979.29 – volume: 33 start-page: 209 year: 2001 ident: 10.1016/j.tcs.2008.04.026_b22 article-title: External memory algorithms and data structures: Dealing with massive data publication-title: ACM Computing Surveys doi: 10.1145/384192.384193 – start-page: 238 year: 2005 ident: 10.1016/j.tcs.2008.04.026_b10 article-title: Lower bounds for sorting with few random accesses to external memory – year: 1998 ident: 10.1016/j.tcs.2008.04.026_b12 – volume: 4 start-page: 177 year: 1970 ident: 10.1016/j.tcs.2008.04.026_b20 article-title: Relationships between nondeterministic and deterministic tape complexities publication-title: Journal of Computer and Systems Sciences doi: 10.1016/S0022-0000(70)80006-X – volume: vol. 2625 year: 2003 ident: 10.1016/j.tcs.2008.04.026_b14 – volume: 380 start-page: 199 issue: 1–2 year: 2007 ident: 10.1016/j.tcs.2008.04.026_b9 article-title: Tight lower bounds for query processing on streaming and external memory data publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2007.02.062 – volume: 45 start-page: 143 issue: 3 year: 1993 ident: 10.1016/j.tcs.2008.04.026_b13 article-title: On the relationship between deterministic time and deterministic reversal publication-title: Information Processing Letters doi: 10.1016/0020-0190(93)90016-3 – start-page: 689 year: 2007 ident: 10.1016/j.tcs.2008.04.026_b3 article-title: Lower bounds for randomized read/write stream algorithms – volume: 36 start-page: 239 year: 1985 ident: 10.1016/j.tcs.2008.04.026_b6 article-title: Bounded depth, polynomial size circuits for symmetric functions publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(85)90045-3 – year: 1986 ident: 10.1016/j.tcs.2008.04.026_b23 – year: 1990 ident: 10.1016/j.tcs.2008.04.026_b1 – start-page: 41 year: 2005 ident: 10.1016/j.tcs.2008.04.026_b21 article-title: Machine models and lower bounds for query processing – start-page: 209 year: 1979 ident: 10.1016/j.tcs.2008.04.026_b24 article-title: Some complexity questions related to distributive computing – volume: 18 start-page: 625 year: 1989 ident: 10.1016/j.tcs.2008.04.026_b11 article-title: Expressibility and parallel complexity publication-title: SIAM Journal on Computing doi: 10.1137/0218043 – year: 1995 ident: 10.1016/j.tcs.2008.04.026_b2 – volume: 20 start-page: 622 issue: 4 year: 1991 ident: 10.1016/j.tcs.2008.04.026_b4 article-title: Reversal complexity publication-title: SIAM Journal on Computing doi: 10.1137/0220039 – year: 1994 ident: 10.1016/j.tcs.2008.04.026_b16 – volume: 24 start-page: 363 issue: 6 year: 1987 ident: 10.1016/j.tcs.2008.04.026_b17 article-title: An improved simulation of space and reversal bounded deterministic turing machines by width and depth bounded uniform circuits publication-title: Information Processing Letters doi: 10.1016/0020-0190(87)90112-8 – start-page: 243 year: 2006 ident: 10.1016/j.tcs.2008.04.026_b7 article-title: Randomized computations on large data sets: Tight lower bounds – volume: 38 start-page: 766 issue: 5 year: 1989 ident: 10.1016/j.tcs.2008.04.026_b18 article-title: A note on nondeterminism in small, fast parallel computers publication-title: IEEE Transactions on Computers doi: 10.1109/12.24282 – ident: 10.1016/j.tcs.2008.04.026_b5
SSID	ssj0000576
Score	1.8949981
Snippet	We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r ( n )...
SourceID	pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	191
SubjectTerms	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Computer science; control theory; systems Data processing. List processing. Character string processing Exact sciences and technology Hierarchies of complexity classes Memory organisation. Data processing Miscellaneous Reversal-bounded and space-bounded Turing machines Software Theoretical computing
Title	Reversal complexity revisited
URI	https://dx.doi.org/10.1016/j.tcs.2008.04.026
Volume	401
WOSCitedRecordID	wos000258203300018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bT9swFLZQy8MQ2oUxwQYoDzxtSpU4DrYfqwk0kIam0Ul9i1znWGtBWdUE1p-_49hJWhBom8RLFEW5-nw5Pj63j5BjlSNsFI9DXHZFIaMgwok2Ev8rBSLicpJHpiab4JeXYjyW3zwlfFnTCfCiEMulnD-rqPEYCtuWzv6DuNub4gHcR6HjFsWO278S_HewmRZ12w_b-XdpzexFXUNerbNyjlZqGLUnd_jkZ8TORboopo4tyqY-urB6F7z5-Rum14ixqgUVrLkRhPVPukpf59t6UN_iaqps3EQ6bpMBOBUpuAwpddTEjQ5l3iOxChanEWNHxuUnV1rXWD_U286FMBtUuvT5rWwQ0Xs9sutZ98q-k30la-qigsKVb5_yVIoe6Q_PT8cX3Tycchep9t_QxLTr7L57D3rMKtmeqxKlYBzJyYrlMXpNXvolQzB0on5DNqDYIa8aOo7Aa-cdsvW1bcFbviWHDQ6CDgdBi4Nd8uPsdPT5S-i5MEKdUF6hIaEMV7nRCS7ZqdQn0iQ6FUKlcQLsRBhcOJsUci0hVxRAUp4zSBM60RSo0sk70it-FbBHAslVapgWQkxilkeJZDEHoUFxqmOmzT6JmrHItG8Ub_lKbrImI3CW4fB5AlOW4fDtk4_tJXPXJeWpk1kzwJkHtTPfMkTDU5cdrQmjfZBtPS2YFO__774fyIvufzggvWpxC4dkU99V03Jx5EH1B8SLfvU
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Reversal+complexity+revisited&rft.jtitle=Theoretical+computer+science&rft.au=Hernich%2C+Andr%C3%A9&rft.au=Schweikardt%2C+Nicole&rft.date=2008-07-23&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=401&rft.issue=1&rft.spage=191&rft.epage=205&rft_id=info:doi/10.1016%2Fj.tcs.2008.04.026&rft.externalDocID=S0304397508003071
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon