:: Library Catalog

Imatge de la portada

Guardat en:

Dades bibliogràfiques
Autor principal:	Kelsey, Steve
Format:	Recurso digital
Idioma:	anglès
Publicat:	Zenodo 2026
Matèries:	Negentropy Algorithms Complexity
Accés en línia:	https://doi.org/10.5281/zenodo.19258085
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars

Entropy and negentropy of private electric vehicles in urban systems: homeostasis of mobility in Mexico
per: Mario Guadalupe González-Pérez
Publicat: (2018)

Bayesian Confirmation of Classical Catholic Ontology via the TNA Theorem
per: Bresciano, Claudio
Publicat: (2025)

A Model for Frequency-Dependent Negentropic Gravity: Astrophysical Signatures of a Dynamic Coherence Field
per: Brandon Dick
Publicat: (2025)

Operational Coherence: Applying the N1 Operator to Physical, Computational, and Neural Systems
per: Bresciano, Claudio
Publicat: (2025)

Axial Gap Ratio as a Universal Tolerance Parameter: Pathological Limits and Trans-Scalar Validation in Biological, Mechanical, and Mathematical Systems
per: DE ALMEIDA, REGIVALDO
Publicat: (2026)

Human-AI Collaboration Protocol (HACP) v1.0: A Structural Framework for High-Fidelity Cognitive Alignment Author (作者) Liu, En-Yen (劉恩言)
per: Enyen, Liu
Publicat: (2026)

Luna Negentropy 1.5 Framework Overview
per: Alves, Lilia
Publicat: (2026)

"Комплексный технологический протокол нейробиологической рекуперации: Технический и Клинический Регламенты (автор Алексеев В. А.)".
per: Alekseev Valery Alexandrovich
Publicat: (2026)

LA TRINITÉ ÉLECTRODYNAMIQUE (COEUR-REIN-CERVEAU)
per: benhadid, OUTAIL
Publicat: (2026)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
per: Dey, Palash, et al.
Publicat: (2026)

Self-referential instances of the dominating set problem are irreducible
per: Zhou, Guangyan
Publicat: (2026)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
per: Eagling-Vose, Tala, et al.
Publicat: (2025)

Dynamic Debt Swapping in Financial Networks
per: Froese, Henri, et al.
Publicat: (2023)

Neighborhood-Aware Graph Labeling Problem
per: Shahverdikondori, Mohammad, et al.
Publicat: (2026)

Lazy Kronecker Product
per: Song, Zhao
Publicat: (2026)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
per: Nederlof, Jesper
Publicat: (2026)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
per: Jiang, Cheng, et al.
Publicat: (2026)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
per: Ducoffe, Guillaume
Publicat: (2026)

Automated Lower Bounds for Small Matrix Multiplication Complexity over Finite Fields
per: Wang, Chengu
Publicat: (2026)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
per: Asadi, Vahid R., et al.
Publicat: (2026)

NP-Hardness and a PTAS for the Pinwheel Problem
per: Kleinberg, Robert, et al.
Publicat: (2026)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
per: Bodlaender, Hans L., et al.
Publicat: (2026)

Online Orthogonal Vectors Revisited
per: Gajulapalli, Karthik, et al.
Publicat: (2026)

Characterizing Streaming Decidability of CSPs via Non-Redundancy
per: Sharma, Amatya, et al.
Publicat: (2026)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
per: Chen, Xi, et al.
Publicat: (2026)

Sublinear-query relative-error testing of halfspaces
per: Chen, Xi, et al.
Publicat: (2026)

Quadratic Speedup for Computing Contraction Fixed Points
per: Chen, Xi, et al.
Publicat: (2026)

A Space-space Trade-off for Directed st-Connectivity
per: Edenhofer, Roman
Publicat: (2026)

Asymptotic Rank Speedup Theorems, Revisited
per: Alman, Josh, et al.
Publicat: (2026)

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
per: Ganian, Robert, et al.
Publicat: (2026)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
per: Khanna, Sanjeev, et al.
Publicat: (2026)

Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs
per: Singer, Noah G., et al.
Publicat: (2026)

Kernelization Bounds for Constrained Coloring
per: Haviv, Ishay
Publicat: (2026)

On the Advantage of Adaptivity for Sampling with Cell Probes
per: Byramji, Farzan, et al.
Publicat: (2026)

Clustering with Locally Bounded Ignorance
per: Garvardt, Jaroslav, et al.
Publicat: (2026)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
per: Srivastava, Ajitesh, et al.
Publicat: (2026)

Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers
per: Oka, Keigo, et al.
Publicat: (2026)

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
per: Mao, Songtao
Publicat: (2026)

Constructing self-referential instances for the clique problem
per: Li, Jiaqi, et al.
Publicat: (2026)

Parameterized Capacitated Vertex Cover Revisited
per: Lampis, Michael, et al.
Publicat: (2026)