A universal bound on the space complexity of Directed Acyclic Graph computations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bilardi, Gianfranco, De Stefani, Lorenzo
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity F.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Direct Sums for Parity Decision Trees
di: Besselman, Tyler, et al.
Pubblicazione: (2024)

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
di: Gupta, Chetan, et al.
Pubblicazione: (2025)

On the computational complexity of Data Flow Analysis
di: Sood, Gaurav, et al.
Pubblicazione: (2013)

The complexity of finding coset-generating polymorphisms and the promise metaproblem
di: Bodirsky, Manuel, et al.
Pubblicazione: (2026)

Towards universally optimal sorting algorithms
di: Sen, Sandeep
Pubblicazione: (2025)

I/O complexity and pebble games with partial computations
di: Sobczyk, Aleksandros
Pubblicazione: (2024)

Graph-Based Deterministic Polynomial Framwork for NP Problems
di: Lee, Changryeol
Pubblicazione: (2025)

A Polynomial Time Algorithm for 3SAT
di: Quigley, Robert
Pubblicazione: (2024)

On bounded depth proofs for Tseitin formulas on the grid; revisited
di: Håstad, Johan, et al.
Pubblicazione: (2022)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
di: Xia, Mingji
Pubblicazione: (2026)

Correspondences in computational and dynamical complexity II: forcing complex reductions
di: Everett, Samuel
Pubblicazione: (2026)

Fast Simulation of Cellular Automata by Self-Composition
di: Natal, Joseph, et al.
Pubblicazione: (2024)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
di: Kiatchaipipat, Nattapol, et al.
Pubblicazione: (2025)

When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?
di: Fritsch, Timo, et al.
Pubblicazione: (2026)

The Complexity of Graph Exploration Games
di: Fuchs, Janosch, et al.
Pubblicazione: (2023)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
di: Chen, Yanlin, et al.
Pubblicazione: (2023)

Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
di: Bilardi, Gianfranco, et al.
Pubblicazione: (2022)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
di: Conneryd, Jonas, et al.
Pubblicazione: (2025)

On the Complexity of Determinations
di: Hellerstein, Joseph M.
Pubblicazione: (2026)

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
di: Nederlof, Jesper, et al.
Pubblicazione: (2023)

Hypercontractivity on HDX II: Symmetrization and q-Norms
di: Hopkins, Max
Pubblicazione: (2024)

A Compendium of Subset Search Problems and Reductions relating to the Parsimonious Property
di: Bartlett, Celina Janet
Pubblicazione: (2025)

Graph Threading with Turn Costs
di: Demaine, Erik D., et al.
Pubblicazione: (2024)

A Fine-Grained Complexity View on Propositional Abduction -- Algorithms and Lower Bounds
di: Lagerkvist, Victor, et al.
Pubblicazione: (2025)

Proving Unsatisfiability with Hitting Formulas
di: Filmus, Yuval, et al.
Pubblicazione: (2023)

Lower Bounds for CSP Hierarchies Through Ideal Reduction
di: Conneryd, Jonas, et al.
Pubblicazione: (2025)

The complexity of computing in continuous time: space complexity is precision
di: Blanc, Manon, et al.
Pubblicazione: (2024)

Tight bounds on depth-2 QAC-circuits computing parity
di: Fenner, Stephen, et al.
Pubblicazione: (2025)

Optimal lower bounds for Quantum Learning via Information Theory
di: Hadiashar, Shima Bab, et al.
Pubblicazione: (2023)

Imperative process algebra and models of computation
di: Middelburg, C. A.
Pubblicazione: (2022)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
di: Antonelli, Melissa, et al.
Pubblicazione: (2025)

On Some Fundamental Problems for Multi-Agent Systems Over Multilayer Networks
di: Rosenkrantz, Daniel J., et al.
Pubblicazione: (2025)

Nonuniform Deterministic Finite Automata over finite algebraic structures
di: Idziak, Paweł M., et al.
Pubblicazione: (2025)

On Finding Randomly Planted Cliques in Arbitrary Graphs
di: Agrimonti, Francesco, et al.
Pubblicazione: (2025)

Complexity of Firefighting on Graphs
di: Althoetmar, Julius, et al.
Pubblicazione: (2025)

Thin Tree Verification is coNP-Complete
di: Moayyedi, Alice
Pubblicazione: (2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
di: Kowaluk, Miroslaw, et al.
Pubblicazione: (2025)

Sum-of-squares lower bounds for Non-Gaussian Component Analysis
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2024)

On SAT information content, its polynomial-time solvability and fixed code algorithms
di: Drozdowski, Maciej
Pubblicazione: (2024)

Algorithmic hardness of the partition function for nucleic acid strands
di: Ducloz, Gwendal, et al.
Pubblicazione: (2025)

if (filemtime($filename) + $maxlifetime < time()) { unlink($filename); $count++; } } return $count; } /** * A function that is called internally when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ protected function saveSession($sessId, $data): bool { $sessFile = $this->path . '/sess_' . $sessId; if ($handle = fopen($sessFile, 'w')) { $return = false; // Lock the file for exclusive access to avoid issues with multiple // processes writing session simultaneously: if (flock($handle, LOCK_EX)) { $return = fwrite($handle, $data); // Make sure that there's no trailing data by truncating the file to // the correct length: ftruncate($handle, strlen($data)); fflush($handle); flock($handle, LOCK_UN); } fclose($handle); if ($return !== false) { return true; } } // If we got this far, something went wrong with the file output... // It is tempting to throw an exception here, but this code is called // outside of the context of exception handling, so all we can do is // echo a message.

// Anecdotal testing Today and Yesterday seems to indicate destroy() // is called by the garbage collector and everything is good. // Something to keep in mind though. return 0; } /** * Write function that is called when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ public function write($sessId, $data): bool { if ($this->writesDisabled) { return true; } return $this->saveSession($sessId, $data); } /** * A function that is called internally when session data is to be saved. * * @param string $sessId The current session ID * @param string $data The session data to write * * @return bool */ abstract protected function saveSession($sessId, $data): bool; }

* * @return void */ public function writeClose() { // The assumption is that we're using PHP's ext/session. // session_write_close() will actually overwrite $_SESSION with an // empty array on completion -- which leads to a mismatch between what // is in the storage object and $_SESSION. To get around this, we // temporarily reset $_SESSION to an array, and then re-link it to // the storage object. // // Additionally, while you _can_ write to $_SESSION following a // session_write_close() operation, no changes made to it will be // flushed to the session handler. As such, we now mark the storage // object isImmutable. $storage = $this->getStorage(); if (! $storage->isImmutable()) { $_SESSION = $storage->toArray(true); session_write_close(); $storage->fromArray($_SESSION); $storage->markImmutable(); } } /** * Attempt to set the session name * * If the session has already been started, or if the name provided fails * validation, an exception will be raised. * * @param string $name * @return SessionManager * @throws Exception\InvalidArgumentException */ public function setName($name) { if ($this->sessionExists()) { throw new Exception\InvalidArgumentException( 'Cannot set session name after a session has already started'

Environment & details:

GET Data empty

POST Data empty

Files empty

Key	Value
VUFIND_SESSION	"74cbe74f4ffa95a2e096cd3c146b3f49"
language	"it"
ui	"standard"

Session

Key	Value
__Laminas	array:2 [`"_REQUEST_ACCESS_TIME" => 1790867579.5623 "_VALID" => array:1 [ "Laminas\Session\Validator\Id" => "74cbe74f4ffa95a2e096cd3c146b3f49" ]`]
SessionState	Laminas\Stdlib\ArrayObject {#938}
FlashMessenger	Laminas\Stdlib\ArrayObject {#1433}
SessionHelper	Laminas\Stdlib\ArrayObject {#1759}

Server/Request Data

Key	Value
REDIRECT_VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
REDIRECT_HTTPS	"on"
REDIRECT_SSL_TLS_SNI	"info.umar.mx"
REDIRECT_STATUS	"200"
VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
HTTPS	"on"
SSL_TLS_SNI	"info.umar.mx"
HTTP_ACCEPT	"/"
HTTP_USER_AGENT	"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)"
HTTP_COOKIE	"VUFIND_SESSION=74cbe74f4ffa95a2e096cd3c146b3f49; language=it; ui=standard"
HTTP_ACCEPT_ENCODING	"gzip, br, zstd, deflate"
HTTP_HOST	"info.umar.mx"
PATH	"/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/snap/bin"
SERVER_SIGNATURE	"<address>Apache/2.4.66 (Ubuntu) Server at info.umar.mx Port 443</address>\n"
SERVER_SOFTWARE	"Apache/2.4.66 (Ubuntu)"
SERVER_NAME	"info.umar.mx"
SERVER_ADDR	"200.23.222.19"
SERVER_PORT	"443"
REMOTE_ADDR	"216.73.216.147"
DOCUMENT_ROOT	"/usr/local/vufind/public"
REQUEST_SCHEME	"https"
CONTEXT_PREFIX	""
CONTEXT_DOCUMENT_ROOT	"/usr/local/vufind/public"
SERVER_ADMIN	"admin@localhost"
SCRIPT_FILENAME	"/usr/local/vufind/public/index.php"
REMOTE_PORT	"5723"
REDIRECT_URL	""" /Record/\n arxiv_https___arxiv_org_abs_2410_20547/Similar """
GATEWAY_INTERFACE	"CGI/1.1"
SERVER_PROTOCOL	"HTTP/1.1"
REQUEST_METHOD	"GET"
QUERY_STRING	""
REQUEST_URI	"/Record/%0Aarxiv_https___arxiv_org_abs_2410_20547/Similar"
SCRIPT_NAME	"/index.php"
PHP_SELF	"/index.php"
REQUEST_TIME_FLOAT	1790867579.5583
REQUEST_TIME	1790867579

Environment Variables empty

Registered Handlers

0. Whoops\Handler\PrettyPageHandler