Conceptio
›
computational-complexity
Topic
computational-complexity
Knowledge-graph topic
· documents ABOUT computational-complexity across the archive
319
Documents about computational-complexity
Documents about computational-complexity
It's Hard to PArcK
#794228
arXiv (All)
A note on the $Σ_2^P$-completeness of the Frobenius number
#797853
arXiv (OAI Expanded)
A note on the $Σ_2^P$-completeness of the Frobenius number
#799276
arXiv (All)
Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
#920237
arXiv (OAI Expanded)
Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
#924468
arXiv (All)
Parameterized Hardness of Zonotope Containment and Neural Network Verification
#925816
arXiv (All)
Promise Systems of Equations over Magmas with Identity and over Algebras in Congruence Modular Varieties
#926388
arXiv (All)
Symmetrization maps and minimal border rank Comon's conjecture
#927104
arXiv (All)
Computable Ergodic Optimisation
#996923
arXiv (All)
The Quantum Overlap Gap Property and Algorithmic Hardness for the Quantum Hypergraph Max-Cut Problem
#997819
arXiv (All)
Optimizing Both Checking and Update Costs in Random Walk Search
#1012992
arXiv (All)
Interactive proofs for verifying (quantum) learning and testing
#1014478
arXiv (All)
A lower bound for $\langle 3,2,m \rangle$ matrix multiplication
#1036464
arXiv (All)
Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding
#1037691
arXiv (All)
The Serial Scaling Hypothesis
#179201
arXiv (OAI)
Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
#284320
HAL (France)
Improving the matrix multiplication exponent with modern optimization and AlphaEvolve
#623156
arXiv (OAI Expanded)
Improving the matrix multiplication exponent with modern optimization and AlphaEvolve
#625429
arXiv (All)
Towards semantic understanding of graph neural network layers embedding with functional semantic activation mapping
#628818
DORAS
Local minima in quantum systems
#682380
arXiv (OAI Expanded)
Local minima in quantum systems
#684155
arXiv (All)
Algorithmic threshold for high-dimensional projection pursuit I: general theory
#790187
arXiv (OAI Expanded)
Algorithmic threshold for high-dimensional projection pursuit I: general theory
#794206
arXiv (All)
Turing complete Navier-Stokes steady states via cosymplectic geometry
#797210
arXiv (OAI Expanded)
Turing complete Navier-Stokes steady states via cosymplectic geometry
#798623
arXiv (All)
On Top-Down and Local Lower Bounds for $\mathrm{AC^0}$ Circuits
#822188
arXiv (All)
Depth-1 expanders on the unitary group and applications
#921027
arXiv (OAI Expanded)
Depth-1 expanders on the unitary group and applications
#925263
arXiv (All)
Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms
#972144
arXiv (All)
Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning
#974537
arXiv (All)
Polynomial-time isomorphism test for solvable groups with abelian Sylow subgroups
#985104
arXiv (All)
An Elementary Proof of the $\widetilde O(n^{1/3})$ Bound for Separating Words
#985567
arXiv (All)
A Novel Mathematical Framework for Determining Whether We Are Living in a Simulation: Integrating Information Theory, Quantum Mechanics, and Computational Complexity
#113851
PhilArchive
Lower Bound on the Representation Complexity of Antisymmetric Tensor Product Functions
#147045
arXiv (OAI)
P与NP：通过《易经格物理论》和《观察者理论》进行的严谨证明
#402192
Figshare
Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma
#609718
arXiv (All)
Cognitive Load and Information Processing in Financial Markets: Theory and Evidence from Disclosure Complexity
#611331
arXiv (OAI Expanded)
Cognitive Load and Information Processing in Financial Markets: Theory and Evidence from Disclosure Complexity
#612808
arXiv (All)
Quantum Computational Complexity of Matrix Functions / Santiago Cifuentes, Samson Wang, Thais L. Silva, Mario Andrea Berta, Leandro Aolita
#629101
Deutsche Nationalbibliothek
Order-preserving structural mapping for message prioritization in intuitionistic fuzzy soft sets
#637752
Springer Nature OA
Learning to erase quantum states: thermodynamic implications of quantum learning theory
#663989
arXiv (OAI Expanded)
Learning to erase quantum states: thermodynamic implications of quantum learning theory
#665489
arXiv (All)
Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms
#668211
arXiv (OAI Expanded)
Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms
#670276
arXiv (All)
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
#974279
arXiv (All)
Accelerating Fourier--Motzkin elimination: redundancy removal and the choice of variable elimination order
#985364
arXiv (All)
Weighted Quantum Signal Processing: Low-Depth Polynomial Approximation with Applications to Kolmogorov-Arnold Networks
#1035963
arXiv (All)
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
#798033
arXiv (OAI Expanded)
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
#799456
arXiv (All)
Cluster-Graph Edit Distance: Optimal Explicit Embeddings, Metric Proxies, and Complexity
#656748
arXiv (OAI Expanded)
← Previous
Page 7 of 8
Next →
Topic record
· derived from the Conceptio knowledge graph (shared subject terms across the corpus)
Conceptio Open Knowledge Archive — topic hubs link to canonical document pages with full provenance.