The navigational power of web browsers

DOI10.1007/s00224-010-9294-3zbMath1253.68039OpenAlexW2125344377MaRDI QIDQ692917

Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche, Michał Bielecki, Marc Spielmann

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9294-3

zbMATH Keywords

computational complexityexpressive powercomputational completenessclick complexitynavigational problemweb browser

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Computable queries for relational data bases
• Finite-memory automata
• Queries and computation on the web
• Languages that Capture Complexity Classes
• Communication Complexity