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
Beyond Distance Ordering: Resource Complexity and Universal Optimality of Exact Labeled Directed Shortest Paths
#971490
arXiv (All)
On the sample complexity of the generalized hidden shift problem over arbitrary finite groups
#973453
arXiv (All)
The König constant is one
#609240
arXiv (OAI Expanded)
IQP circuits for 2-Forrelation
#668500
arXiv (OAI Expanded)
IQP circuits for 2-Forrelation
#670565
arXiv (All)
2-Fold Forrelation is in QAC$^0$
#975125
arXiv (All)
Separating Non-redundancy and Chain Length
#1011628
arXiv (All)
Near-Logarithmic Inapproximability of Parameterized Set Cover
#1014213
arXiv (All)
On the complexity and approximation of the maximum expected value all-or-nothing subset
#954991
Koc University Digital Collections
Refined Kolmogorov complexity of analog, evolving and stochastic recurrent neural networks
#291913
HAL (France)
Disjoint covering of bipartite graphs with $s$-clubs
#152998
arXiv (OAI)
Lower Bounds for Subset Sum in Resolution with Modular Counting
#158594
arXiv (OAI)
Polynomial-Time Mistake-Bounded Language Generation
#664315
arXiv (OAI Expanded)
Polynomial-Time Mistake-Bounded Language Generation
#665815
arXiv (All)
The Separation of $\mathit{NP}$ and $\mathit{PSPACE}$
#974124
arXiv (All)
Learning Sparse Quantum States
#1000182
arXiv (All)
Universal NP-Hardness of Clustering under General Utilities
#1012139
arXiv (All)
The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
#821387
arXiv (All)
On the computational complexity of ethics: moral tractability for minds and machines
#96227
PhilArchive
Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics
#105873
PhilArchive
When prediction fails: a computational complexity view of stress.
#450045
NCBI PubMed Central
When More Generators Hurt: Shellsort on Full Product Grids
#608979
arXiv (OAI Expanded)
When More Generators Hurt: Shellsort on Full Product Grids
#610041
arXiv (All)
PSPACE-Hard 2D Super Mario Games: Thirteen Doors
#611244
arXiv (OAI Expanded)
PSPACE-Hard 2D Super Mario Games: Thirteen Doors
#612721
arXiv (All)
Discrepancy of geometric incidences
#788366
arXiv (OAI Expanded)
Discrepancy of geometric incidences
#792366
arXiv (All)
A Dichotomy for Complex Boolean Holant with Binary Disequality
#809686
arXiv (OAI Expanded)
Bounded Relative Boundary Implies Narrow DNF Approximation
#809702
arXiv (OAI Expanded)
A Dichotomy for Complex Boolean Holant with Binary Disequality
#819682
arXiv (All)
Bounded Relative Boundary Implies Narrow DNF Approximation
#819698
arXiv (All)
Subgroup Accessibility in Group Order Logic
#819943
arXiv (All)
Improved Depth-2 Linear Circuits for Disjointness via Quenched Lyapunov Exponents
#925960
arXiv (All)
Improved Small Set Expansion in High Dimensional Expanders
#973006
arXiv (All)
Quantum Query Complexity of Persistence Statistics in Graph Zigzags
#973439
arXiv (All)
QMA Lower Bounds for Batch Verification via Approximate Degree
#996922
arXiv (All)
Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
#920169
arXiv (OAI Expanded)
Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
#924400
arXiv (All)
Quantum Query Complexity of Finding a Tarski Fixed Point on a High-Dimensional Grid
#926685
arXiv (All)
Riesz Energy Subset Selection in the Euclidean Plane is NP-Hard: A Reduction from the Ising Model on Planar Cubic Graphs
#674569
arXiv (OAI Expanded)
Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
#144227
arXiv (OAI)
Logical-arithmetic entropy and the principle of maximum entropy Irreversibility and computational complexity
#96886
PhilArchive
Are controlled unitaries helpful?
#163177
arXiv (OAI)
From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
#609266
arXiv (OAI Expanded)
Classical Adversarial Fault-Tolerance and PCPs
#623135
arXiv (OAI Expanded)
Classical Adversarial Fault-Tolerance and PCPs
#625408
arXiv (All)
More Asymmetry Yields Faster Matrix Multiplication
#633186
arXiv (OAI Expanded)
More Asymmetry Yields Faster Matrix Multiplication
#635535
arXiv (All)
HIV modelling - parallel implementation strategies
#641815
DORAS
Canonization of a random graph by two matrix-vector multiplications
#650544
arXiv (OAI Expanded)
← Previous
Page 2 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.