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
On the undecidability of quantum channel capacities
#997463
arXiv (All)
Learning Depth-3 Circuits with Polynomial Savings
#1011861
arXiv (All)
Almost Optimal FPT Inapproximability for k-SetCover
#1014273
arXiv (All)
Revisiting average case complexity of multilevel syllogistic
#972447
arXiv (All)
A Survey on the Applications of Zero-Knowledge Proofs
#139084
arXiv (OAI)
Answering Related Questions
#158659
arXiv (OAI)
Analog computation with transcriptional networks
#160933
arXiv (OAI)
Amplitude amplification and estimation require inverses
#163176
arXiv (OAI)
Differentially Private Verification of Distribution Properties
#609910
arXiv (All)
Resolution of The Linear-Bounded Automata Question
#617224
arXiv (OAI Expanded)
Resolution of The Linear-Bounded Automata Question
#617724
arXiv (All)
Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants
#618884
arXiv (OAI Expanded)
Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants
#620563
arXiv (All)
Fault-Tolerant Quantum Computation with Adversarial Errors
#623132
arXiv (OAI Expanded)
Fault-Tolerant Quantum Computation with Adversarial Errors
#625405
arXiv (All)
Simulation of heterogeneous motorised traffic at a signalised intersection
#641814
DORAS
Reconfiguration of Connected Graph Partitions
#663911
arXiv (OAI Expanded)
Reconfiguration of Connected Graph Partitions
#665411
arXiv (All)
Completing the Foundations of Complexity: Integrating Wolfram’s Computational Framework with Malicse’s Universal Formula
#709181
PhilArchive
Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families
#779769
arXiv (OAI Expanded)
Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families
#781144
arXiv (All)
Quantified propositional calculi and narrow implicit proofs
#820505
arXiv (All)
Quantum Blind Rotation for Fast Functional Bootstrapping
#821671
arXiv (All)
How to Verify Probabilistic Consistency of Predictive Models
#973309
arXiv (All)
Improved Multilayered PCPs and Hypergraph Vertex Cover
#974864
arXiv (All)
The Limits of Complexity: Why Feature Engineering Beats Deep Learning in Investor Flow Prediction
#984112
arXiv (All)
Promises should be taken seriously: On relativization with promise problems
#985349
arXiv (All)
Algorithmic List Decoding of Reed-Solomon Codes up to Capacity
#985406
arXiv (All)
Small-Bias Quantum Approximate Counting via the Multiplicative Adversary Method
#996624
arXiv (All)
When Does a Quantum Speedup Survive End-to-End?
#996667
arXiv (All)
Euclidean SVP is deterministically NP-hard to approximate within any constant factor
#997529
arXiv (All)
PureSuperQMA(exp) = BellPureSymQMA(poly) = QMA via Dimension-Free Bosonic Argmax
#999535
arXiv (All)
Improved lower bounds for decomposable randomized encoding
#1011729
arXiv (All)
Hidden Circuits and Exact Counting in Ordered Graphs
#1011828
arXiv (All)
Rational Reductions and Regular Languages of Constant Circuit Complexity
#1012666
arXiv (All)
Linear complexity
#780514
eScholarship
Equilibria of Round-Robin: Computational Hardness and Fairness for Few Subadditive Agents
#1012501
arXiv (All)
Epistemic Skills: Reasoning about Knowledge and Oblivion
#155551
arXiv (OAI)
First Order Logic on Pathwidth Revisited Again
#189008
arXiv
First Order Logic on Pathwidth Revisited Again
#189058
arXiv Biology
First Order Logic on Pathwidth Revisited Again
#189108
arXiv (OAI Expanded)
First Order Logic on Pathwidth Revisited Again
#189158
arXiv (OAI)
Computational Complexity of Uncapacitated Multi-Echelon Production Plannin Problems
#493455
Cornell eCommons
You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games
#611246
arXiv (OAI Expanded)
You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games
#612723
arXiv (All)
Bounds on the real tensor rank of octonion multiplication
#622945
arXiv (OAI Expanded)
Bounds on the real tensor rank of octonion multiplication
#625218
arXiv (All)
Gold-standard corpus and evaluation scripts
#661881
Figshare
Concentration Inequalities for Branching Random Walks with Applications to Phase Transitions in CSPs
#789339
arXiv (OAI Expanded)
Concentration Inequalities for Branching Random Walks with Applications to Phase Transitions in CSPs
#793343
arXiv (All)
← Previous
Page 4 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.