| 251 |
Nearly orthogonal vectors and small antipodal spherical codes
Boris Bukh, Christopher Cox
|
🔮
The Ethereal
|
math.CO
|
36 |
8 years ago |
| 252 |
Fine-grained Complexity Meets IP = PSPACE
Lijie Chen, Shafi Goldwasser, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
36 |
8 years ago |
| 253 |
Location of zeros for the partition function of the Ising model on bounded degree graphs
Han Peters, Guus Regts
|
🔮
The Ethereal
|
math.CO
|
36 |
7 years ago |
| 254 |
On an open problem about a class of optimal ternary cyclic codes
Dongchun Han, Haode Yan
|
🔮
The Ethereal
|
math.CO
|
36 |
7 years ago |
| 255 |
MRD-codes arising from the trinomial $x^q+x^{q^3}+cx^{q^5}\in\mathbb{F}_{q^6}[x]$
Giuseppe Marino, Maria Montanucci, Ferdinando Zullo
|
🔮
The Ethereal
|
math.CO
|
36 |
7 years ago |
| 256 |
The Imandra Automated Reasoning System (system description)
Grant Olney Passmore, Simon Cruanes, ... (+7 more)
|
🔮
The Ethereal
|
cs.LO
|
36 |
6 years ago |
| 257 |
Planar Graphs that Need Four Pages
Mihalis Yannakakis
|
🔮
The Ethereal
|
math.CO
|
36 |
6 years ago |
| 258 |
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Marthe Bonamy, Édouard Bonnet, ... (+6 more)
|
🔮
The Ethereal
|
math.CO
|
36 |
4 years ago |
| 259 |
Near-optimal bounds on bounded-round quantum communication complexity of disjointness
Mark Braverman, Ankit Garg, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
35 |
11 years ago |
| 260 |
Approximation Algorithm for Minimum Weight $(k,m)$-CDS Problem in Unit Disk Graph
Yishuo Shi, Zhao Zhang, Ding-Zhu Du
|
🔮
The Ethereal
|
cs.DM
|
35 |
10 years ago |
| 261 |
Algebraic Databases
Patrick Schultz, David I. Spivak, ... (+2 more)
|
🔮
The Ethereal
|
math.CT
|
35 |
10 years ago |
| 262 |
Non-Malleable Codes for Small-Depth Circuits
Marshall Ball, Dana Dachman-Soled, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
35 |
8 years ago |
| 263 |
An Assertion-Based Program Logic for Probabilistic Programs
Gilles Barthe, Thomas Espitau, ... (+4 more)
|
🔮
The Ethereal
|
cs.LO
|
35 |
8 years ago |
| 264 |
PPP-Completeness with Connections to Cryptography
Katerina Sotiraki, Manolis Zampetakis, Giorgos Zirdelis
|
🔮
The Ethereal
|
cs.CC
|
35 |
7 years ago |
| 265 |
Clique-Width for Hereditary Graph Classes
Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
|
🔮
The Ethereal
|
math.CO
|
35 |
7 years ago |
| 266 |
The Bang Calculus Revisited
Antonio Bucciarelli, Delia Kesner, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
35 |
6 years ago |
| 267 |
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
Afonso S. Bandeira, Jess Banks, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
35 |
5 years ago |
| 268 |
Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
Daniel Bertschinger, Christoph Hertrich, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
35 |
4 years ago |
| 269 |
On the Solvability of Inductive Problems: A Study in Epistemic Topology
Alexandru Baltag, Nina Gierasimczuk, Sonja Smets
|
🔮
The Ethereal
|
cs.LO
|
34 |
10 years ago |
| 270 |
An Introduction to Quantum Computing, Without the Physics
Giacomo Nannicini
|
🔮
The Ethereal
|
cs.DM
|
34 |
8 years ago |
| 271 |
The Parameterized Hardness of the k-Center Problem in Transportation Networks
Andreas Emil Feldmann, Daniel Marx
|
🔮
The Ethereal
|
cs.CC
|
34 |
8 years ago |
| 272 |
Centrality-Friendship Paradoxes: When Our Friends Are More Important Than Us
Desmond J. Higham
|
🔮
The Ethereal
|
cs.DM
|
34 |
8 years ago |
| 273 |
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
Jérémie Chalopin, Victor Chepoi, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
34 |
7 years ago |
| 274 |
On the tree-width of even-hole-free graphs
Pierre Aboulker, Isolde Adler, ... (+3 more)
|
🔮
The Ethereal
|
cs.DM
|
34 |
5 years ago |
| 275 |
Trace Reconstruction Problems in Computational Biology
Vinnu Bhardwaj, Pavel A. Pevzner, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
34 |
5 years ago |
| 276 |
Automata and Fixpoints for Asynchronous Hyperproperties
Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem
|
🔮
The Ethereal
|
cs.LO
|
34 |
5 years ago |
| 277 |
First-Order Model Checking on Structurally Sparse Graph Classes
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
|
🔮
The Ethereal
|
cs.LO
|
34 |
3 years ago |
| 278 |
Reticulation-visible networks
Magnus Bordewich, Charles Semple
|
🔮
The Ethereal
|
math.CO
|
33 |
10 years ago |
| 279 |
The Rationale behind the Concept of Goal
Guido Governatori, Francesco Olivieri, ... (+3 more)
|
🔮
The Ethereal
|
cs.LO
|
33 |
10 years ago |
| 280 |
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
Pierre-Étienne Meunier, Damien Woods
|
🔮
The Ethereal
|
cs.CC
|
33 |
9 years ago |
| 281 |
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism
Daniel Neuen, Pascal Schweitzer
|
🔮
The Ethereal
|
cs.CC
|
33 |
9 years ago |
| 282 |
On Strong NP-Completeness of Rational Problems
Dominik Wojtczak
|
🔮
The Ethereal
|
cs.DM
|
33 |
8 years ago |
| 283 |
Finite LTL Synthesis with Environment Assumptions and Quality Measures
Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith
|
🔮
The Ethereal
|
cs.LO
|
33 |
7 years ago |
| 284 |
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
Hugo Jacob, Marcin Pilipczuk
|
🔮
The Ethereal
|
cs.DM
|
33 |
4 years ago |
| 285 |
A Holant Dichotomy: Is the FKT Algorithm Universal?
Jin-Yi Cai, Zhiguo Fu, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
32 |
11 years ago |
| 286 |
Average Distance in a General Class of Scale-Free Networks with Underlying Geometry
Karl Bringmann, Ralph Keusch, Johannes Lengler
|
🔮
The Ethereal
|
cs.DM
|
32 |
10 years ago |
| 287 |
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids
T-H. Hubert Chan, Zhiyi Huang, ... (+3 more)
|
🔮
The Ethereal
|
cs.DM
|
32 |
9 years ago |
| 288 |
Verifying Security Policies in Multi-agent Workflows with Loops
Bernd Finkbeiner, Christian Müller, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
32 |
8 years ago |
| 289 |
Learning to Prove Safety over Parameterised Concurrent Systems (Full Version)
Yu-Fang Chen, Chih-Duo Hong, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
32 |
8 years ago |
| 290 |
A Trichotomy for Regular Trail Queries
Wim Martens, Matthias Niewerth, Tina Popp
|
🔮
The Ethereal
|
cs.FL
|
32 |
7 years ago |
| 291 |
Placement Delivery Arrays from Combinations of Strong Edge Colorings
Jerod Michel, Qi Wang
|
🔮
The Ethereal
|
math.CO
|
32 |
7 years ago |
| 292 |
Extending Description Logic EL++ with Linear Constraints on the Probability of Axioms
Marcelo Finger
|
🔮
The Ethereal
|
cs.LO
|
32 |
6 years ago |
| 293 |
Combining subspace codes
Antonio Cossidente, Sascha Kurz, ... (+2 more)
|
🔮
The Ethereal
|
math.CO
|
32 |
6 years ago |
| 294 |
Automated Temporal Equilibrium Analysis: Verification and Synthesis of Multi-Player Games
Julian Gutierrez, Muhammad Najib, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
32 |
5 years ago |
| 295 |
Co-lexicographically Ordering Automata and Regular Languages -- Part I
Nicola Cotumaccio, Giovanna D'Agostino, ... (+2 more)
|
🔮
The Ethereal
|
cs.FL
|
32 |
3 years ago |
| 296 |
Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More
Xin Li
|
🔮
The Ethereal
|
cs.CC
|
32 |
3 years ago |
| 297 |
Abstract Learning Frameworks for Synthesis
Christof Löding, P. Madhusudan, Daniel Neider
|
🔮
The Ethereal
|
cs.LO
|
31 |
11 years ago |
| 298 |
Quantum Max-flow/Min-cut
Shawn X. Cui, Michael H. Freedman, ... (+3 more)
|
🔮
The Ethereal
|
math.CO
|
31 |
10 years ago |
| 299 |
Fast Parallel Fixed-Parameter Algorithms via Color Coding
Max Bannach, Christoph Stockhusen, Till Tantau
|
🔮
The Ethereal
|
cs.CC
|
31 |
10 years ago |
| 300 |
Algorithmic statistics: forty years later
Nikolai Vereshchagin, Alexander Shen
|
🔮
The Ethereal
|
cs.CC
|
31 |
9 years ago |