f-2-1

Documents about f-2-1

• The Thermodynamic Complexity of Circuits#1455674arXiv (All)
• The Komlós Problem in Matrix-Multiplication Time#1356331arXiv (All)
• Constructive solvability and the P versus NP problem#617261arXiv (OAI Expanded)
• Constructive solvability and the P versus NP problem#617761arXiv (All)
• A quantum model for synchronizing finite state transition systems#1149437arXiv (OAI Expanded)
• A Rank for Discontinuities of Multivalued Functions#1123160arXiv (OAI Expanded)
• Recognizers for Graph-Encoding Languages#1215829arXiv (All)
• Revisiting average case complexity of multilevel syllogistic#972447arXiv (All)
• Simple, Faster (min, +) Matrix Multiplication and APSP#1355226arXiv (All)
• Type-Checking for Pattern-Based Tree Transformations#1248617arXiv (All)
• The Kaleidoscopic Filter, Part I : A Structural Resolution of Restricted Integer Partitions#1109782arXiv (OAI Expanded)
• A construction of F-irregular graphs#984646arXiv (All)
• A Better Analysis For PPSZ For 3-SAT#1468275arXiv (All)
• Exact $T$-counts of CCZ layers from an isotropy bound#1361502arXiv (OAI Expanded)
• Compile-Time Tensor Shape Checking via Staged Shape-Dependent Types#1052139arXiv (All)
• Subexponential-Time Exact-One Hitting Set#1536808arXiv (All)
• Algorithmic Unverifiability of Safety for Fixed and Recursively Self-Improving Systems#1063956arXiv (All)
• Computing GR(1) Assume-Guarantee Contracts#1469204arXiv (All)
• Extracting total Amb programs from proofs#155454arXiv (OAI)
• Tensor Decomposition for Non-Clifford Gate Minimization#1458255arXiv (All)
• Ancilla-free randomized Toffoli gates and the T-count of Boolean oracles#1488981arXiv (All)
• Lowered crossover points of Anthropic's subexponential 3-SAT algorithm#1534791arXiv (All)
• The Serial Scaling Hypothesis#179201arXiv (OAI)
• An ETH-based quasipolynomial lower bound for Dualization#1248753arXiv (All)
• Optimization Geometry of QAOA and Variational Quantum Algorithms#1201537arXiv (All)
• First-Class Refinement Types for Scala#1115542arXiv (All)
• A Mathematical Model of Motivated Emotional Mind - Cognitive Embodied System#1034255arXiv (All)
• Two $\operatorname{ReLU}$ Layers is All You Need#1412644arXiv (All)
• Finite-Precision Quantum Mechanics: Quantum Parcels, Information and Geometry#650860arXiv (OAI Expanded)
• Finite-Precision Quantum Mechanics: Quantum Parcels, Information and Geometry#652313arXiv (All)
• Group Isomorphism and the Polylogarithmic-Time Hierarchy: Depth-2$\frac{1}{2}$ Circuits and Lower Bounds#1489502arXiv (All)
• Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints#1131911arXiv (All)
• A simplified proof of polynomial improvements for 3SUM and APSP#1326913arXiv (All)
• Geometric Complexity Theory and Graph Isomorphism#1052213arXiv (All)
• How to Bake Quantum into Your Pet Petri Nets and Have Your Net Theory Too#1355846arXiv (All)
• MEM as an Extension of Recurrent Processing Theory: Toward a Motivational Account of Consciousness#1199331arXiv (All)
• Encoder-Decoder Transformers: Logical Characterizations and Periodicity#1129248arXiv (All)
• Accelerating Floating-Point Satisfiability Solving via Gradient Normalization#1232847arXiv (All)
• Graph Distortion Distances, Gromov-Hausdorff and the Hardness of Gromov-Wasserstein#1341808arXiv (All)
• Separating Circuits: Switching Lemmas and Random Restrictions#1411694arXiv (All)
• Bandwidth Efficient Livestreaming in Mobile Wireless Networks: A Peer-to-Peer ACIDE Solution#1116051arXiv (All)
• Limits and Constants of OpenAI's Claimed ETH Refutation#1536347arXiv (All)
• On Periodic and Aperiodic Optimal Strategies in Solvency Games#1014032arXiv (All)
• Adversarial Problems and the Limits of Uniform Resolution#1447050arXiv (All)
• Adaptive Rotation for iSOMA: Geometry, Benchmarking, and Noise Robustness in Variational Quantum Objectives#1132394arXiv (All)
• Attainable Boundaries versus Operational Equivalence: Dual Benchmarks for the Hierarchical Assessment of Quantum Resources#1248021arXiv (All)
• Methods for Counting and Enumerating Set Partitions#1199741arXiv (All)
• The Kaleidoscopic Filter on the Partition Manifold, Part I: The Simplicial Ehrhart, Barycentric Pascal Product, and Continuous Bernoulli Exact Closed Forms for $p(n)$#1399785arXiv (All)
• Asymmetric Weighted Earliness-Tardiness: Scheduling with a Nonrestrictive Common Due Date#1110439arXiv (OAI Expanded)
• A Calculus for Units of Measure with Conversion#1142843arXiv (All)