68q17

Documents about 68q17

• Riftbound is Turing Complete#1118912arXiv (All)
• Partitionability is NP-complete#1402471arXiv (All)
• The Separation of $\mathit{NP}$ and $\mathit{PSPACE}$#974124arXiv (All)
• Non-elementary modal logics, assuming P $\neq$ NP#997846arXiv (All)
• On $k$-limited domination: complexity and Sierpiński graphs#1156855arXiv (All)
• The Complexity of Minimal Positive Realization#1411937arXiv (All)
• Computational complexity of static output feedback stabilization#1155325arXiv (All)
• Arc Kayles is PSPACE-complete#1049512arXiv (All)
• Static output-feedback stabilization is NP-hard#1123303arXiv (OAI Expanded)
• Decidability of the Orbit Problem Over $\mathbb{Q}(X)$#790208arXiv (OAI Expanded)
• Decidability of the Orbit Problem Over $\mathbb{Q}(X)$#794227arXiv (All)
• Spectral density estimation for normal matrices#1144820arXiv (All)
• Improving the Constant in the Aharonov--Regev Theorem#1233329arXiv (All)
• Resolution of The Linear-Bounded Automata Question#617224arXiv (OAI Expanded)
• Resolution of The Linear-Bounded Automata Question#617724arXiv (All)
• Edge complexity of weighted graphs: involutory symmetries and NP-hardness#1050034arXiv (All)
• NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049arXiv (All)
• Lower Bound of 22 for 3x3 Matrix Multiplication over the Integers#1156910arXiv (All)
• On Lattice Diameter Segments: Algorithms and Structure#1199692arXiv (All)
• Bounds on the real tensor rank of octonion multiplication#622945arXiv (OAI Expanded)
• Bounds on the real tensor rank of octonion multiplication#625218arXiv (All)
• Completely Reachable Road Coloring#800101arXiv (All)
• Tight Hardness for Temporal Path Covers at Vertex-Cover Number Two#1083371arXiv (OAI Expanded)
• Nonstandard combinatorial ultrafilters and a new local witness model#1325914arXiv (All)
• Note on the capacity and geometric realizability of combinatorial mobile sensor networks#611197arXiv (OAI Expanded)
• Note on the capacity and geometric realizability of combinatorial mobile sensor networks#612674arXiv (All)
• Testing epimorphism onto the bicyclic monoid is $\mathsf{NP}$-complete#1217933arXiv (All)
• Tensors, entanglement, separability, and their complexity#1249318arXiv (All)
• Maximal Linear Arrangement is NP complete on Bipartite Graphs#1296620arXiv (All)
• Quantum Physics using Weighted Model Counting#177120arXiv (OAI)
• NP-hardness of ideal lattice problems#1109858arXiv (OAI Expanded)
• On the NP-Hardness of Unconstrained Static Output Feedback Stabilization#1143329arXiv (All)
• Settling the Approximability of Submodular Facility Location#1344320arXiv (All)
• Recognizing Level-k-Based Phylogenetic Networks is NP-Complete#650873arXiv (OAI Expanded)
• Recognizing Level-k-Based Phylogenetic Networks is NP-Complete#652326arXiv (All)
• An Operator Approach to Register Programs for Catalytic Computing#1012863arXiv (All)
• Undefinability of Approximation of 2-to-2 Games#1037712arXiv (All)
• VC Dimension and Expressivity of Real-Valued Transformers#1115955arXiv (All)
• A Linear-Time Algorithm for the Unbiased Claw Game on Graphs with Maximum Degree 4#1357533arXiv (All)
• When Are Monomial Symmetric Polynomials Hard?#1400014arXiv (All)
• Intractability of Hilbert's Nullstellensatz implies algebraic hardness of permanent#1401828arXiv (All)
• A note on the $Σ_2^P$-completeness of the Frobenius number#797853arXiv (OAI Expanded)
• A note on the $Σ_2^P$-completeness of the Frobenius number#799276arXiv (All)
• The Cayley Completion of a Graph#808941arXiv (OAI Expanded)
• The Cayley Completion of a Graph#818933arXiv (All)
• Promise Systems of Equations over Magmas with Identity and over Algebras in Congruence Modular Varieties#926388arXiv (All)
• Symmetrization maps and minimal border rank Comon's conjecture#927104arXiv (All)
• Getting to the Root: A Combined Complexity Perspective on Consistent Query Answering#999840arXiv (All)
• A lower bound for $\langle 3,2,m \rangle$ matrix multiplication#1036464arXiv (All)
• Structural and computational aspects of majority coloring games#1142104arXiv (All)