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
The Parameter Report: An Orientation Guide for Data-Driven Parameterization
#650644
arXiv (OAI Expanded)
King Chasing Problem in Chinese Chess is NP-hard
#650803
arXiv (OAI Expanded)
Canonization of a random graph by two matrix-vector multiplications
#651997
arXiv (All)
The Parameter Report: An Orientation Guide for Data-Driven Parameterization
#652097
arXiv (All)
King Chasing Problem in Chinese Chess is NP-hard
#652256
arXiv (All)
Online Correlation Clustering with Metric Weights
#668667
arXiv (OAI Expanded)
Online Correlation Clustering with Metric Weights
#670732
arXiv (All)
Unconditional $V^0_1$-independence of a certified hitting-set principle
#789047
arXiv (OAI Expanded)
Unconditional $V^0_1$-independence of a certified hitting-set principle
#793051
arXiv (All)
Exact quantum splitting and the structure of finite algebras
#798128
arXiv (OAI Expanded)
Exact quantum splitting and the structure of finite algebras
#799551
arXiv (All)
Distinctness threshold for pseudorandom unitaries
#921196
arXiv (OAI Expanded)
Distinctness threshold for pseudorandom unitaries
#925432
arXiv (All)
Maximum Matching-Match: Hardness and Approximation
#975248
arXiv (All)
Has quantum advantage been achieved?
#985015
arXiv (All)
NP-Hardness of the $H$-Free Edge-Deletion Problem
#996542
arXiv (All)
Automated Lower Bounds for Bilinear Complexity over Finite Fields
#789587
arXiv (OAI Expanded)
Automated Lower Bounds for Bilinear Complexity over Finite Fields
#793591
arXiv (All)
A Note on Binary Quadratic Systems and their relation to complexity theory
#984667
arXiv (All)
Structural Stress and Political Instability in the MENA Region: A Computational Macrohistory Analysis of the Arab Spring
#68464
DataCite
Structural Stress and Political Instability in the MENA Region: A Computational Macrohistory Analysis of the Arab Spring
#68465
DataCite
The $\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs
#623223
arXiv (OAI Expanded)
The $\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs
#625496
arXiv (All)
Descriptive Complexity in Lean: Completeness by First-Order Reductions
#1012457
arXiv (All)
Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
#820207
arXiv (All)
Some derivations among Logarithmic Space Bounded Counting Classes
#172175
arXiv Biology
Some derivations among Logarithmic Space Bounded Counting Classes
#173191
arXiv (OAI)
Fagin's Theorem for Semiring Turing Machines
#173332
arXiv (OAI)
Some derivations among Logarithmic Space Bounded Counting Classes
#173441
arXiv (OAI Expanded)
Some derivations among Logarithmic Space Bounded Counting Classes
#174019
arXiv
Computational complexity perspective on graphical calculi for quantum computation
#296051
UBIRA ETheses
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
#613954
arXiv (OAI Expanded)
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
#614921
arXiv (All)
Time- and Space-Efficient List Decoding up to Capacity
#616556
arXiv (OAI Expanded)
Time- and Space-Efficient List Decoding up to Capacity
#617056
arXiv (All)
Good Locally Testable Codes with Small Alphabet and Small Query Size
#623217
arXiv (OAI Expanded)
Good Locally Testable Codes with Small Alphabet and Small Query Size
#625490
arXiv (All)
Wildfire Suppression: Complexity, Models, and Instances
#633438
arXiv (OAI Expanded)
Wildfire Suppression: Complexity, Models, and Instances
#635787
arXiv (All)
Quantum Computing: Lecture Notes
#682355
arXiv (OAI Expanded)
Quantum Computing: Lecture Notes
#684130
arXiv (All)
The Informational Disorder Scale A Rigorous Framework for Computational Complexity in Self-Referential Systems
#697294
PhilArchive
Vanilla Exact Synthesis of CNOT Circuits is NP-hard
#927026
arXiv (All)
A characterization of efficiently compilable constraint languages
#927083
arXiv (All)
Ulam Rank Aggregation Is Hard to Approximate for Four Rankings
#973494
arXiv (All)
Fault-tolerant quantum processing of physical experiments
#974404
arXiv (All)
Quantum Kravchuk Transform using $\mathfrak{su}(2)$ fast-forwarding
#985127
arXiv (All)
Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
#986090
arXiv (All)
Parallel Kac's Walk Generates PRU
#987426
arXiv (All)
On the Limits of Quantum Multiparty Simultaneous Communication
#997183
arXiv (All)
← Previous
Page 3 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.