Imagen de Portada

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Scheinerman, Danny
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Rational Search via Stern-Brocot Tree
por: Weyers, Connor, et al.
Publicado: (2025)

Faster diameter computation in graphs of bounded Euler genus
por: Kluk, Kacper, et al.
Publicado: (2025)

Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
por: Dhawan, Abhishek
Publicado: (2024)

Fast Mixing in Sparse Random Ising Models
por: Liu, Kuikui, et al.
Publicado: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

Connected Partitions via Connected Dominating Sets
por: Niklanovits, Aikaterini, et al.
Publicado: (2025)

A Unified View of Graph Regularity via Matrix Decompositions
por: Bodwin, Greg, et al.
Publicado: (2019)

Improved space-time tradeoff for TSP via extremal set systems
por: Dallant, Justin, et al.
Publicado: (2026)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
por: Glover, Charles N.
Publicado: (2024)

A Faster Deterministic Approximation Algorithm for TTP-2
por: Kanaya, Yuga, et al.
Publicado: (2023)

On 2-strong connectivity orientations of mixed graphs and related problems
por: Georgiadis, Loukas, et al.
Publicado: (2023)

A Fast Coloring Oracle for Average Case Hypergraphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$
por: Bajard, Jean Claude, et al.
Publicado: (2020)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Counting Permutation Patterns with Multidimensional Trees
por: Beniamini, Gal, et al.
Publicado: (2024)

Lightweight Near-Additive Spanners
por: Gitlitz, Yuval, et al.
Publicado: (2024)

Lower bounds for graph reconstruction with maximal independent set queries
por: Michel, Lukas, et al.
Publicado: (2024)

Matroid Intersection under Minimum Rank Oracle
por: Bárász, Mihály, et al.
Publicado: (2024)

Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
por: Nozaki, Yuta, et al.
Publicado: (2024)

Minor Containment and Disjoint Paths in almost-linear time
por: Korhonen, Tuukka, et al.
Publicado: (2024)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
por: Murakami, Hitoshi, et al.
Publicado: (2024)

Sampling List Packings
por: Camrud, Evan, et al.
Publicado: (2024)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
por: Hu, Jialu, et al.
Publicado: (2024)

Random Generation of Git Graphs
por: Courtiel, Julien, et al.
Publicado: (2024)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Compression with wildcards: All induced metric subgraphs
por: Wild, Marcel
Publicado: (2024)

On the occupancy fraction of the antiferromagnetic Ising model
por: Davies, Ewan, et al.
Publicado: (2024)

Optimal Bounds for Distinct Quartics
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2024)

Distance Reconstruction of Sparse Random Graphs
por: Bastide, Paul
Publicado: (2024)

Sampling and counting triangle-free graphs near the critical density
por: Jenssen, Matthew, et al.
Publicado: (2024)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
por: Korhonen, Tuukka
Publicado: (2024)

Spectral Sparsification by Deterministic Discrepancy Walk
por: Lau, Lap Chi, et al.
Publicado: (2024)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
por: Norose, Ryoma, et al.
Publicado: (2024)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
por: Biedl, Therese, et al.
Publicado: (2024)

Rollercoasters with Plateaus
por: Adamson, Duncan, et al.
Publicado: (2024)

Erdős-Gyárfás conjecture on graphs without long induced paths
por: Hegde, Anand Shripad, et al.
Publicado: (2024)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
por: Jenssen, Matthew, et al.
Publicado: (2024)

Reconfiguration Using Generalized Token Jumping
por: Křišťan, Jan Matyáš, et al.
Publicado: (2024)

Switching Classes: Characterization and Computation
por: Antony, Dhanyamol, et al.
Publicado: (2024)