:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	福永, 大河
Format:	Recurso digital
Language:
Published:	Zenodo 2026
Online Access:	https://doi.org/10.5281/zenodo.18374114
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem
by: Luo, Lixia, et al.
Published: (2024)

The Subset Sum Matching Problem
by: Wu, Yufei, et al.
Published: (2025)

Some NP Complete Problems Based on Algebra and Algebraic Geometry
by: Hriljac, Paul
Published: (2025)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
by: Bampis, Evripidis, et al.
Published: (2025)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
by: Sinhal, Anay, et al.
Published: (2026)

先天性プロテインC欠損症に伴う上腸間膜静脈血栓症に対し保存的治療をした1例(Superior mesenteric venous thrombosis due to protein C deficiency treated by conservative therapy: A case report)
by: 室谷知孝, et al.
Published: (2024)

Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
by: Badihian, Neema Rustin
Published: (2025)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
by: Aggarwal, Divesh, et al.
Published: (2024)

The Quiver Problem is NP Complete
by: Kac, Victor, et al.
Published: (2025)

Geometry Of The Subset Sum Problem -- Part I
by: Bollepalli, Srinivas Balaji
Published: (2025)

On a Geometric Interpretation Of the Subset Sum Problem
by: Costandin, Marius
Published: (2024)

System and Method for Deterministic Polynomial-Time Graph Optimization and NP Problem Reduction Patent Description
by: Gillis, John Archie
Published: (2025)

Matrix Domination: Convergence of a Genetic Algorithm Metaheuristic with the Wisdom of Crowds to Solve the NP-Complete Problem
by: Strachan, Shane Storm
Published: (2023)

A Generalisation on Erdős Distinct Subset Sums Problem
by: Gu, Zijie
Published: (2025)

NP-complete Problems can be Solved and Verified in Polynomial Time
by: Syzdykov, Mirzakhmet
Published: (2025)

The 2-Attractor Problem is NP-Complete
by: Fuchs, Janosch, et al.
Published: (2023)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)

Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space
by: Sajith, Thejas Radhika
Published: (2025)

An Improved Pseudopolynomial Time Algorithm for Subset Sum
by: Chen, Lin, et al.
Published: (2024)

Interlacing Polynomial Method for the Column Subset Selection Problem
by: Cai, Jian-Feng, et al.
Published: (2023)

Atom Cavity Encoding for NP-Complete Problems
by: Ye, Meng, et al.
Published: (2024)

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

Improved Space Bounds for Subset Sum
by: Belova, Tatiana, et al.
Published: (2024)

Completely Bounded Representations Into Von Neumann Algebras And Connes Embedding Problem
by: Fang, Junsheng, et al.
Published: (2026)

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

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)

Solving the Best Subset Selection Problem via Suboptimal Algorithms
by: Singh, Vikram, et al.
Published: (2025)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

Algorithmic Structure in Subset Sum: Deterministic In-Bound Navigation and the Counting Complexity Divide
by: Nkosi, Thami
Published: (2025)

Derandomizing Pseudopolynomial Algorithms for Subset Sum
by: Chan, Timothy M.
Published: (2026)

Beating Bellman's Algorithm for Subset Sum
by: Bringmann, Karl, et al.
Published: (2024)

Enhanced Algorithms for the Representation of integers by Binary Quadratic forms: Reduction to Subset Sum
by: Mamah, Maher
Published: (2025)

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

DNA Probe Computing System for Solving NP-Complete Problems
by: Xu, Jin, et al.
Published: (2025)

Subset Balancing and Generalized Subset Sum via Lattices
by: Gao, Yiming, et al.
Published: (2026)

Lower Bounds for Subset Sum in Resolution with Modular Counting
by: Part, Fedor
Published: (2022)

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

COVID–19罹患後早期に発症したBickerstaff型脳幹脳炎の2症例(Bickerstaff brainstem encephalitis developed quickly after COVID–19 infection)
by: 森大樹, et al.
Published: (2024)

A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP
by: Kyaw, Kyaw Phone Thar
Published: (2025)