„logspace“

Suchergebnisse

1.000+ Treffer

• Capturing Relativized Complexity Classes without Order
  Dawar, Anuj ; Gottlob, Georg ; Hella, Lauri
• Melting down the number of variables for the inclusion problem for pattern languages and logspace-decidability of determinism of regular languages
  Bremer, Joachim ; Schweikardt, Nicole ; Köbler, Johannes ; Freydenberger, Dominik 2025 Humboldt-Universität zu Berlin
• Space efficient algorithms for graph isomorphism and representation
  Kuhnert, Sebastian ; Köbler, Johannes ; Schweikardt, Nicole ; Grohe, Martin 2016 Mathematisch-Naturwissenschaftliche Fakultät
• Parallel Complexity of Depth-First-Search and Maximal Path in Restricted Graph Classes
  Chauhan, Archit ; Datta, Samir ; Praveen, M. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deciding circular-arc graph isomorphism in parameterized logspace
  Chandoo, Maurice 2016 Gottfried Wilhelm Leibniz Universität Hannover
• Canonizing Graphs of Bounded Tree Width in Logspace
  Elberfeld, Michael ; Schweitzer, Pascal 2016 Universitätsbibliothek der RWTH Aachen
• Derandomizing Logspace With a Small Shared Hard Drive
  Pyne, Edward
• Directed st-Connectivity with Few Paths Is in Quantum Logspace
  Apers, Simon ; Edenhofer, Roman 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation in (Poly-) Logarithmic Space
  Biswas, Arindam ; Raman, Venkatesh ; Saurabh, Saket 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Leakage-Resilient Hardness Equivalence to Logspace Derandomization
  Shalunov, Yakov 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Derandomizing Logspace with a Small Shared Hard Drive
  Pyne, Edward 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Planar Graph Isomorphism is in Log-Space
  Datta, Samir ; Limaye, Nutan ; Nimbhorkar, Prajakta ; Thierauf, Thomas ; Wagner, Fabian
• Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations
  Chen, Michael ; Pavan, A. ; Vinodchandran, N. V. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• List Colouring Trees in Logarithmic Space
  Bodlaender, Hans L. ; Groenland, Carla ; Jacob, Hugo 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reachability and Matching in Single Crossing Minor Free Graphs
  Datta, Samir ; Gupta, Chetan ; Jain, Rahul ; Mukherjee, Anish ; Sharma, Vimal Raj ; Tewari, Raghunath 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
  Girish, Uma ; Raz, Ran ; Zhan, Wei 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterised Counting in Logspace
  Haak, Anselm ; Meier, Arne ; Prakash, Om ; Rao B. V., Raghavendra 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
  Gupta, Chetan ; Sharma, Vimal Raj ; Tewari, Raghunath 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterised Counting in Logspace
  Haak, Anselm ; Meier, Arne ; Prakash, Om ; Rao, B. V. Raghavendra 2023 Gottfried Wilhelm Leibniz Universität Hannover
• Parameterised Counting in Logspace
  Haak, Anselm ; Meier, Arne ; Prakash, Om ; Rao, B. V. Raghavendra