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
Completely Reachable Road Coloring
#800101
arXiv (All)
Towards a Characterization of Counting and Alternating Classes via Discrete Ordinary Differential Equations
#809450
arXiv (OAI Expanded)
Towards a Characterization of Counting and Alternating Classes via Discrete Ordinary Differential Equations
#819443
arXiv (All)
SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
#821507
arXiv (All)
Separating QMA from QCMA with a classical oracle
#925851
arXiv (All)
Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding
#971587
arXiv (All)
A Near-Linear Element Kernel for \(d\)-Hitting Set
#974083
arXiv (All)
RevCRN: Reversible Analog Computation using Chemical Reaction Networks
#974535
arXiv (All)
Online Treasure Hunt in Vertex-Permuted Dynamic Rings
#998581
arXiv (All)
Linear Algebra of Generalized Contextuality in All Prepare-Transform-Measure Scenarios
#1012286
arXiv (All)
Efficient Quantum Voting with Information-Theoretic Security
#1014435
arXiv (All)
Achieving perfect completeness for one- and two-message quantum proof systems
#1014848
arXiv (All)
Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
#189342
arXiv (OAI)
Unlocking the VR Potential in Retail: From 3D Showcases to Fully Immersive Shopping Experience
#394999
DORAS
Note on the capacity and geometric realizability of combinatorial mobile sensor networks
#611197
arXiv (OAI Expanded)
Note on the capacity and geometric realizability of combinatorial mobile sensor networks
#612674
arXiv (All)
Tight Inapproximability of Pacing and Throttling Equilibria in Second-Price Auctions
#622972
arXiv (OAI Expanded)
Tight Inapproximability of Pacing and Throttling Equilibria in Second-Price Auctions
#625245
arXiv (All)
Computational Complexity of the Weisfeiler-Leman Dimension / Moritz Lichter, Simon Raßmann, Pascal Schweitzer
#628988
Deutsche Nationalbibliothek
Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard
#788904
arXiv (OAI Expanded)
Hardness of Approximation of Rank Aggregation on Ulam Metric
#789980
arXiv (OAI Expanded)
Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard
#792908
arXiv (All)
Hardness of Approximation of Rank Aggregation on Ulam Metric
#793999
arXiv (All)
On the Expressive Power and Limitations of Multi-Layer SSMs
#920314
arXiv (OAI Expanded)
Equality cases of the Stanley--Yan log-concave matroid inequality
#920791
arXiv (OAI Expanded)
On the Expressive Power and Limitations of Multi-Layer SSMs
#924545
arXiv (All)
Equality cases of the Stanley--Yan log-concave matroid inequality
#925025
arXiv (All)
Random Garbage Separates XOR from Forward-Only Queries
#984255
arXiv (All)
Strategyproofness-Exposing Descriptions of Matching Mechanisms
#996849
arXiv (All)
Subexponential Approximation of the Permanent in Deterministic Polynomial Time
#997388
arXiv (All)
When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs
#998125
arXiv (All)
The Low-Individual-Degree Test Without the Diagonal-Lines Test Is Not Quantum-Sound
#1000302
arXiv (All)
DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
#1012177
arXiv (All)
Minimizing the Arithmetic and Communication Complexity of Jacobi's Method for Eigenvalues and Singular Values: Part One -- Serial Algorithms
#153080
arXiv (OAI)
Symmetric Linear Arc Monadic Datalog and Gadget Reductions
#149172
arXiv (OAI)
Smart Streets as a Cyber-Physical Social Platform: A Conceptual Framework
#353540
DORAS
Pre-Model Representation Failures in GNN-Based Smart Contract Vulnerability Detection
#611130
arXiv (OAI Expanded)
Pre-Model Representation Failures in GNN-Based Smart Contract Vulnerability Detection
#612607
arXiv (All)
Distributed Quantum Advantage in Locally Checkable Labeling Problems
#617311
arXiv (OAI Expanded)
Distributed Quantum Advantage in Locally Checkable Labeling Problems
#617811
arXiv (All)
Tight Sample Bounds for Renyi and Min-Entropy Estimation
#623262
arXiv (OAI Expanded)
Tight Sample Bounds for Renyi and Min-Entropy Estimation
#625535
arXiv (All)
Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p > 2
#633652
arXiv (OAI Expanded)
Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p > 2
#636001
arXiv (All)
A slightly improved upper bound for quantum statistical zero-knowledge
#664104
arXiv (OAI Expanded)
A slightly improved upper bound for quantum statistical zero-knowledge
#665604
arXiv (All)
Upper and lower bounds on the OBDD-width of a special integer multiplication
#808728
arXiv (OAI Expanded)
Upper and lower bounds on the OBDD-width of a special integer multiplication
#818720
arXiv (All)
Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries
#920762
arXiv (OAI Expanded)
Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries
#924996
arXiv (All)
← Previous
Page 5 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.