:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Gillis, John Archie
Format:	Recurso digital
Langue:
Publié:	Zenodo 2025
Accès en ligne:	https://doi.org/10.5281/zenodo.17582138
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Graph-Based Deterministic Polynomial Framwork for NP Problems
par: Lee, Changryeol
Publié: (2025)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
par: Jiang, Xinwen, et autres
Publié: (2021)

NP-complete Problems can be Solved and Verified in Polynomial Time
par: Syzdykov, Mirzakhmet
Publié: (2025)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
par: Bampis, Evripidis, et autres
Publié: (2025)

Polynomial Time Convergence for NP-Complete Problems via Bounded Carry Algebra: A Hierarchical Reduction Algorithm for the Subset Sum Problem
par: 福永, 大河
Publié: (2026)

P = NP via Constructive Bidirectional Polynomial-Time Reduction Between SAT and Binary Search
par: Aguilera Katayama, Kaoru
Publié: (2026)

Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
par: Badihian, Neema Rustin
Publié: (2025)

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

Learning Deterministic One-Counter Automata in Polynomial Time
par: Mathew, Prince, et autres
Publié: (2025)

PatentLMM: Large Multimodal Model for Generating Descriptions for Patent Figures
par: Shukla, Shreya, et autres
Publié: (2025)

Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time
par: McMahan, Jeremy
Publié: (2024)

The Symmetry Dial: A Physical Origin for the P vs. NP Problem and the Polynomial Hierarchy
par: Babulik, Peter
Publié: (2025)

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

NP-Engine: Empowering Optimization Reasoning in Large Language Models with Verifiable Synthetic NP Problems
par: Li, Xiaozhe, et autres
Publié: (2025)

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
par: Kayibi, Koko-Kalambay Kalafan
Publié: (2018)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
par: Sinhal, Anay, et autres
Publié: (2026)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
par: Gaspers, Serge, et autres
Publié: (2025)

A New Reduction Method from Multivariate Polynomials to Univariate Polynomials
par: Wang, Cancan, et autres
Publié: (2024)

Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)
par: Istrate, Gabriel
Publié: (2024)

Alignment is Localized: A Causal Probe into Preference Layers
par: Chaudhury, Archie
Publié: (2025)

Female (and Asian) leaders better than males in battle against Covid
par: Archie Brown
Publié: (2024)

Diversión extrema con Gotcha / Archie Munro
par: Munro, Archie

A second-order stochastic effective theory for the long-distance behaviour of scalar fields in de Sitter spacetime
par: Cable, Archie
Publié: (2024)

La tierra y la fauna de µfrica / Archie Carr ; traducción de Agustín B rcena
par: Carr, Archie
Publié: (1980)

Deterministic SAT Decision Under Restrictions: Decision Signatures, Residual Structure, and a Structural Reduction of the P vs. NP Question
par: Schenk, Philipp
Publié: (2025)

Polynomial Reduction Methods and their Impact on QAOA Circuits
par: Schmidbauer, Lukas, et autres
Publié: (2024)

The Quiver Problem is NP Complete
par: Kac, Victor, et autres
Publié: (2025)

DNA Probe Computing System for Solving NP-Complete Problems
par: Xu, Jin, et autres
Publié: (2025)

Autonomous Space Manufacturing Paradigm – Draft & Patent Description
par: Izhaev, Islam
Publié: (2025)

图数理论及P vs NP问题/Graph Theory and the P vs NP Problem
par: ch, hy
Publié: (2026)

A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
par: Janičić, Predrag
Publié: (2025)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
par: Lin, Tianrong
Publié: (2021)

CemeterEase: A GIS-Based Cross-Platform System for Cemetery Plot Inventory Management and Navigation
par: Bustamante, Michael John, et autres
Publié: (2025)

Spectral Methods for Polynomial Optimization
par: Moreno, Elvira, et autres
Publié: (2025)

Information Redistribution Under Reductions in NP Search
par: Wei, Jing-Yuan
Publié: (2026)

Random Polynomial Graphs for Random Turán Problems
par: Spiro, Sam
Publié: (2022)

Oscillator Formulations of Many NP Problems
par: Cai, Wenxiao, et autres
Publié: (2025)

The 2-Attractor Problem is NP-Complete
par: Fuchs, Janosch, et autres
Publié: (2023)

PatentMind: A Multi-Aspect Reasoning Graph for Patent Similarity Evaluation
par: Yoo, Yongmin, et autres
Publié: (2025)

Broadcast Graph Is NP-complete
par: Xu, Jinghan, et autres
Publié: (2024)