https://pinboard.in/u:Vaguery/public/ recent bookmarks from Vaguery 2026-05-24T12:22:36+00:00 https://inria.hal.science/hal-05593313v1 Vaguery numerical-methods computational-complexity algorithms rather-interesting special-cases to-write-about to-simulate approximation https://pinboard.in/ https://pinboard.in/u:Vaguery/b:6249741238f1/ 2026-05-24T11:08:57+00:00 https://arxiv.org/abs/2407.03357 Vaguery algorithms numerical-methods computational-complexity rather-interesting performance-measure consider:looking-to-see https://pinboard.in/ https://pinboard.in/u:Vaguery/b:99ab92c256bf/ 2026-02-25T22:06:02+00:00 https://dl.acm.org/doi/full/10.1145/3674634 Vaguery computer-science symbolic-analysis formal-languages functional-programming to-understand computational-complexity efficiency consider:Push https://pinboard.in/ https://pinboard.in/u:Vaguery/b:e124ca6a05b6/ 2026-02-20T14:02:22+00:00 https://arxiv.org/abs/2504.03460 Vaguery number-theory logic-programming rather-interesting theorem-proving to-understand computational-complexity https://pinboard.in/ https://pinboard.in/u:Vaguery/b:6bfd6da31ac7/ 2025-12-31T18:17:15+00:00 https://arxiv.org/abs/1109.5635 Vaguery strings edit-distance algorithms computational-complexity rather-interesting to-understand follow-cites https://pinboard.in/ https://pinboard.in/u:Vaguery/b:7479f24f2b7a/ 2025-12-31T17:56:32+00:00 https://arxiv.org/abs/2005.07678 Vaguery0. Our result completes a research direction set forth in the recent breakthrough paper [Chakraborty-Das-Goldenberg-Koucky-Saks, FOCS'18], which showed the first constant-factor approximation algorithm with a (strongly) sub-quadratic running time. The recent results of [Koucky-Saks, STOC'20] and [Brakensiek-Rubinstein, STOC'20] have shown near-linear time algorithms that obtain an additive approximation, near-linear in n (equivalently, constant-factor approximation when the edit distance value is close to n). In contrast, our algorithm obtains a constant-factor approximation in near-linear time for any input strings. In contrast to prior algorithms, which are mostly recursing over smaller substrings, our algorithm gradually smoothes out the local contribution to the edit distance over progressively larger substrings. To accomplish this, we iteratively construct a distance oracle data structure for the metric of edit distance on all substrings of input strings, of length niε for i=0,1,…,1/ε. The distance oracle approximates the edit distance over these substrings in a certain average sense, just enough to estimate the overall edit distance. ]]> strings computational-complexity algorithms rather-interesting approximation to-write-about to-implement consider:Push-code https://pinboard.in/ https://pinboard.in/u:Vaguery/b:71df08420968/ 2025-08-17T12:19:53+00:00 https://arxiv.org/abs/2112.12678 Vaguery data-structures symbolic-dynamics strings computational-complexity rather-interesting to-understand this-might-be-just-the-thing ReQ https://pinboard.in/ https://pinboard.in/u:Vaguery/b:b2621692edf2/ 2025-08-11T13:51:03+00:00 https://arxiv.org/abs/2209.15542 Vaguery number-theory approximation rational-numbers rather-interesting looking-to-see computational-complexity to-write-about to-simulate representation https://pinboard.in/ https://pinboard.in/u:Vaguery/b:73b9846f5700/ 2025-06-24T14:55:59+00:00 https://dl.acm.org/doi/abs/10.1145/3715739 Vaguery numerical-methods multiobjective-optimization constraint-satisfaction computational-complexity rather-interesting operations-research to-write-about to-simulate consider:lexicase https://pinboard.in/ https://pinboard.in/u:Vaguery/b:52946ee4b76f/ 2025-05-27T22:44:00+00:00 https://www.pnas.org/doi/10.1073/pnas.0710743106 Vaguery machine-learning approximation algorithms rather-interesting computational-complexity to-understand mathematical-programming metaheuristics https://pinboard.in/ https://pinboard.in/u:Vaguery/b:d4e94025ab87/ 2024-11-16T14:50:53+00:00 https://arxiv.org/abs/2109.13103 Vaguery multiobjective-optimization operations-research computational-complexity rather-interesting metaheuristics to-write-about consider:performance-measures https://pinboard.in/ https://pinboard.in/u:Vaguery/b:674b873506e1/ 2024-11-01T19:14:15+00:00 https://arxiv.org/abs/2212.04320 Vaguery algorithms computer-science architecture to-understand unconventional-computing acceleration computational-complexity consider:genetic-programming https://pinboard.in/ https://pinboard.in/u:Vaguery/b:c7c2b27eeb14/ 2024-10-05T14:09:10+00:00 https://hal.science/hal-04710512v1 Vaguery graph-theory mathematical-recreations game-theory rather-interesting computational-complexity to-write-about to-simulate consider:looking-to-see consider:random-sampling consider:performance-measures https://pinboard.in/ https://pinboard.in/u:Vaguery/b:0ecde86680b1/ 2024-09-08T15:23:21+00:00 https://arxiv.org/abs/2112.12197 Vaguery algorithmic-information-theory AIT computational-complexity looking-to-see rather-interesting halting-problem enumeration combinatorics to-understand consider:FFX consider:not-worrying https://pinboard.in/ https://pinboard.in/u:Vaguery/b:872641e819d6/ 2024-04-01T11:33:55+00:00 https://arxiv.org/abs/2308.08868 Vaguery computational-complexity graph-theory algorithms horse-races rather-interesting looking-to-see to-write-about consider:evolved consider:stress-testing https://pinboard.in/ https://pinboard.in/u:Vaguery/b:368bb27f15be/ 2023-10-10T10:10:09+00:00 https://arxiv.org/abs/2209.07524 Vaguery distance metrics edit-distance rather-interesting algorithms computational-complexity to-understand to-write-about consider:genetic-programming consider:structure-function https://pinboard.in/ https://pinboard.in/u:Vaguery/b:266589466b64/ 2023-09-30T12:37:54+00:00 https://arxiv.org/abs/2205.09663 Vaguery numerical-methods computational-complexity computational-geometry algorithms rather-interesting nudge-targets consider:looking-to-see to-visualize https://pinboard.in/ https://pinboard.in/u:Vaguery/b:28b76b883a7e/ 2023-09-09T13:40:02+00:00 https://arxiv.org/abs/2210.02292 Vaguery strings palindromes algorithms computational-complexity data-structures rather-interesting to-understand https://pinboard.in/ https://pinboard.in/u:Vaguery/b:fa87703719d4/ 2023-08-08T11:27:53+00:00 https://dl.acm.org/doi/10.1145/234535.234536 Vaguery computational-geometry algorithms computational-complexity discrepancy numerical-methods monte-carlo to-write-about to-implement to-visualize https://pinboard.in/ https://pinboard.in/u:Vaguery/b:607e399d731c/ 2023-07-30T16:19:14+00:00 https://arxiv.org/abs/2207.09618 Vaguery optimization computational-complexity metaheuristics rather-interesting numerical-methods hypergraphs representation distributed-processing to-write-about https://pinboard.in/ https://pinboard.in/u:Vaguery/b:f9687f995259/ 2023-04-12T13:06:24+00:00 https://arxiv.org/abs/2205.13202 Vaguery hypergraphs graph-theory algorithms computational-complexity rather-interesting https://pinboard.in/ https://pinboard.in/u:Vaguery/b:aa408bec37d3/ 2023-02-07T13:01:32+00:00 https://arxiv.org/abs/2109.08962 Vaguery number-theory enumeration continued-fractions rather-interesting to-understand representation approximation optimization computational-complexity https://pinboard.in/ https://pinboard.in/u:Vaguery/b:2d5320455881/ 2023-01-01T13:09:52+00:00 https://arxiv.org/abs/2203.01794 Vaguery0 is an arbitrarily small constant, such that given any segment ab⎯⎯⎯⎯⎯⎯ and two points s,t∈P we can compute the Fréchet distance between ab⎯⎯⎯⎯⎯⎯ and the curve of P in between s and t in O((n/k)log2n+log4n) time. This is the first result that allows efficient exact Fréchet distance queries for arbitrarily oriented segments. We also present two applications of our data structure: we show that we can compute a local δ-simplification (with respect to the Fréchet distance) of a polygonal curve in O(n5/2+ε) time, and that we can efficiently find a translation of an arbitrary query segment ab⎯⎯⎯⎯⎯⎯ that minimizes the Fréchet distance with respect to a subcurve of P. ]]> computational-geometry computational-complexity algorithms distance preprocessing approximation rather-interesting to-simulate to-write-about consider:oracles https://pinboard.in/ https://pinboard.in/u:Vaguery/b:5471ba660ae6/ 2022-05-14T10:50:13+00:00 https://arxiv.org/abs/1203.4667 Vaguery analog-computing representation simulation computational-complexity to-understand nonlinear-dynamics https://pinboard.in/ https://pinboard.in/u:Vaguery/b:adde835968e4/ 2022-03-29T15:46:25+00:00 https://arxiv.org/abs/2102.01567 Vaguery machine-learning horse-races resource-allocation rather-interesting computational-complexity to-write-about consider:lexicase consider:comparison-to-archiving https://pinboard.in/ https://pinboard.in/u:Vaguery/b:6847dc3122f1/ 2022-03-17T10:52:01+00:00 https://arxiv.org/abs/2105.07512 Vaguery image-processing neural-networks generative-models approximation compression to-write-about to-visualize consider:performance-measures machine-learning computational-complexity https://pinboard.in/ https://pinboard.in/u:Vaguery/b:e52739abcbfa/ 2022-03-15T15:51:26+00:00 https://arxiv.org/abs/1709.02990 Vaguery hypergraphs graph-theory algorithms graph-coloring computational-complexity to-understand to-write-about to-visualize https://pinboard.in/ https://pinboard.in/u:Vaguery/b:c45ed0ef1df5/ 2022-02-28T13:59:14+00:00 https://arxiv.org/abs/2001.04109 Vaguery matrices algorithms numerical-methods computational-complexity rather-interesting to-write-about to-visualize consider:genetic-programming https://pinboard.in/ https://pinboard.in/u:Vaguery/b:14bb5e1045e9/ 2022-02-17T11:10:28+00:00 https://arxiv.org/abs/2010.15770 Vaguery graph-theory algorithms hypergraphs computational-complexity to-simulate to-visualize https://pinboard.in/ https://pinboard.in/u:Vaguery/b:56b524ee82bd/ 2022-02-09T13:13:14+00:00 https://arxiv.org/abs/2005.02329 Vaguery TSP optimization computational-complexity algorithms rather-interesting to-write-about consider:differences-in-behavior consider:sampling https://pinboard.in/ https://pinboard.in/u:Vaguery/b:066a49583f08/ 2022-02-01T12:14:36+00:00 https://arxiv.org/abs/2010.11448 Vaguery hypergraphs graph-theory algorithms rather-interesting computational-complexity consider:the-thing-rather-than-the-method https://pinboard.in/ https://pinboard.in/u:Vaguery/b:b4e033a7becf/ 2022-01-29T14:04:51+00:00 https://arxiv.org/abs/2108.08613 Vaguery edit-distance computational-complexity algorithms strings rather-interesting to-write-about consider:genetic-programming consider:visualization https://pinboard.in/ https://pinboard.in/u:Vaguery/b:0462c88f827d/ 2022-01-29T13:53:55+00:00 https://arxiv.org/abs/1804.10186 Vaguery edit-distance trees computational-complexity algorithms rather-interesting might-be-useful https://pinboard.in/ https://pinboard.in/u:Vaguery/b:37917acf2248/ 2022-01-28T12:07:04+00:00 https://arxiv.org/abs/2111.05386 Vaguery computational-geometry computational-complexity out-of-the-box TSP variant-problems algorithms optimization to-write-about to-visualize consider:multiobjective https://pinboard.in/ https://pinboard.in/u:Vaguery/b:02d90f2612d1/ 2022-01-27T17:39:02+00:00 https://arxiv.org/abs/2111.02544 Vaguery computational-complexity computational-geometry algorithms rather-interesting optimization to-write-about to-visualize consider:genetic-programming consider:representation consider:hillclimbing https://pinboard.in/ https://pinboard.in/u:Vaguery/b:3dfb3cfccec1/ 2022-01-27T11:50:51+00:00 https://arxiv.org/abs/2106.14020 Vaguery mathematical-recreations computational-complexity constraint-satisfaction rather-interesting algorithms to-write-about to-visualize consider:looking-to-see consider:sampling https://pinboard.in/ https://pinboard.in/u:Vaguery/b:4c16865388a3/ 2022-01-26T13:44:39+00:00 https://arxiv.org/abs/1810.02241 Vaguery diffy-Qs discrete-mathematics nonlinear-dynamics representation rather-interesting computational-complexity models-and-modes to-understand to-write-about consider:genetic-programming consider:approximation ReQ https://pinboard.in/ https://pinboard.in/u:Vaguery/b:b5692977ee6e/ 2022-01-22T12:57:29+00:00 https://arxiv.org/abs/2111.02992 Vaguery computational-complexity algorithms graph-theory rather-interesting nudge-targets consider:representation consider:rediscovery https://pinboard.in/ https://pinboard.in/u:Vaguery/b:c79ed6a6c051/ 2021-11-28T15:52:37+00:00 https://arxiv.org/abs/2011.11695 Vaguery machine-learning distributed-processing rather-interesting algorithms computational-complexity sustainability optimization to-understand software-development-is-not-programming https://pinboard.in/ https://pinboard.in/u:Vaguery/b:8ed145e5333b/ 2021-11-04T11:09:48+00:00 https://arxiv.org/abs/1905.03645# Vaguery operations-research computational-complexity algorithms rather-interesting to-simulate to-visualize https://pinboard.in/ https://pinboard.in/u:Vaguery/b:2411c7466dea/ 2021-10-23T06:47:31+00:00 https://arxiv.org/abs/2003.02605 Vaguery0, assuming that the coordinates of all input objects are in [0,N]d and each of their edges has length at least 1. We obtain the following results: ∙ For weighted intervals, we maintain a (1+ϵ)-approximate solution. ∙ For d-dimensional hypercubes we maintain a (1+ϵ)2d-approximate solution in the unweighted case and a O(2d)-approximate solution in the weighted case. Also, we show that for maintaining an unweighted (1+ϵ)-approximate solution one needs polynomial update time for d≥2 if the ETH holds. ∙ For weighted d-dimensional hyperrectangles we present a dynamic algorithm with approximation ratio (1+ϵ)logd−1N. ]]> computational-complexity computational-geometry multiobjective-optimization rather-interesting to-write-about to-simulate consider:genetic-programming approximation https://pinboard.in/ https://pinboard.in/u:Vaguery/b:4cb39f59b01a/ 2021-10-22T10:35:06+00:00 https://arxiv.org/abs/2011.02735 Vaguery group-theory graph-theory rather-interesting information-theory algorithms to-understand computational-complexity unanswerable-questions formal-languages https://pinboard.in/ https://pinboard.in/u:Vaguery/b:589ef3cd7bc6/ 2021-10-06T11:20:34+00:00 https://arxiv.org/abs/1710.03702 Vaguery computational-complexity rather-interesting looking-to-see optimization numeric-methods algorithms feature-extraction to-write-about consider:GP-for-extremization representation https://pinboard.in/ https://pinboard.in/u:Vaguery/b:3128cd3a255e/ 2021-10-06T11:08:05+00:00 https://arxiv.org/abs/1702.05589 Vaguery enumeration optimization computational-complexity proxy-problems rather-interesting consider:GP-precompilation consider:vector-arithmetic https://pinboard.in/ https://pinboard.in/u:Vaguery/b:6cd1255dd587/ 2021-10-03T20:02:21+00:00 https://arxiv.org/abs/1901.07842 Vaguery graph-theory feature-construction computational-complexity algorithms rather-interesting to-write-about to-visualize consider:random-sampling https://pinboard.in/ https://pinboard.in/u:Vaguery/b:65803e19bf3a/ 2021-10-01T20:42:20+00:00 https://arxiv.org/abs/2107.10897 Vaguery computational-complexity algorithms discrete-mathematics rather-interesting permutations to-understand to-simulate https://pinboard.in/ https://pinboard.in/u:Vaguery/b:2ea3990f786e/ 2021-09-12T12:50:46+00:00 https://publications.mfo.de/handle/mfo/1413 Vaguery mathematics Diophantine-equations constraint-satisfaction explanation computational-complexity https://pinboard.in/ https://pinboard.in/u:Vaguery/b:b0b1ee7fbd9b/ 2021-07-11T20:39:53+00:00 https://arxiv.org/abs/1901.01930 Vaguery distributed-processing to-understand computer-science formalization programming-language computational-complexity https://pinboard.in/ https://pinboard.in/u:Vaguery/b:f3379ddde585/ 2021-07-03T12:09:15+00:00 https://arxiv.org/abs/2102.05548 Vaguery hypergraphs matroids computational-complexity algorithms constraint-satisfaction rather-interesting to-simulate to-write-about consider:extreme-cases https://pinboard.in/ https://pinboard.in/u:Vaguery/b:a50861e75f13/ 2021-06-27T10:12:23+00:00 https://arxiv.org/abs/2012.09715 Vaguery numerical-methods approximation rather-interesting simulation sampling performance-measure computational-complexity nudge-targets consider:representation consider:performance-measures consider:lexicase consider:extreme-values https://pinboard.in/ https://pinboard.in/u:Vaguery/b:8ed61cde1044/ 2021-06-17T22:01:27+00:00 https://arxiv.org/abs/2011.14035 Vaguery computational-geometry 3d augmented-reality rather-interesting computational-complexity consider:visualization https://pinboard.in/ https://pinboard.in/u:Vaguery/b:182da50a9ab6/ 2021-05-26T10:27:40+00:00 https://arxiv.org/abs/1802.06478 Vaguery graph-theory algorithms computational-complexity to-write-about consider:visualization consider:genetic-programming https://pinboard.in/ https://pinboard.in/u:Vaguery/b:73463940e0aa/ 2021-05-22T23:10:24+00:00 http://proceedings.mlr.press/v48/lic16.html Vaguery algorithms computational-complexity to-understand machine-learning rather-interesting efficiency https://pinboard.in/ https://pinboard.in/u:Vaguery/b:fb58e2900767/ 2021-05-22T22:47:01+00:00 https://arxiv.org/abs/1703.00440 Vaguery algorithms computational-complexity rather-interesting impressive-even to-understand consider:generalizations consider:fitness-sorting https://pinboard.in/ https://pinboard.in/u:Vaguery/b:aabd18e64a5d/ 2021-05-19T11:01:29+00:00 https://arxiv.org/abs/2105.02483 Vaguery plane-geometry optimization nudge-targets computational-geometry computational-complexity algorithms to-write-about to-simulate consider:landscape-duagrams https://pinboard.in/ https://pinboard.in/u:Vaguery/b:fbc26f50a173/ 2021-05-11T19:10:01+00:00 https://arxiv.org/abs/1906.01450 Vaguery machine-learning time-series representation algorithms computational-complexity to-understand consider:visualization https://pinboard.in/ https://pinboard.in/u:Vaguery/b:28aab9f52cb0/ 2021-05-05T10:47:52+00:00 https://swift.org/blog/swift-collections/ Vaguery swift software-development library data-structures rather-interesting to-learn computational-complexity https://pinboard.in/ https://pinboard.in/u:Vaguery/b:cef2a999d61f/ 2021-03-17T20:21:26+00:00 https://arxiv.org/abs/2012.05275 Vaguery combinatorics algorithms computational-complexity rather-interesting to-write-about to-simulate consider:genetic-programming data-structures https://pinboard.in/ https://pinboard.in/u:Vaguery/b:1fdf091e1be9/ 2021-01-21T21:08:56+00:00 https://arxiv.org/abs/1904.05459 Vaguery0 and a randomized algorithm that takes as input an integer n and two strings x,y of length at most n, and runs in time O(n1+1T) and outputs an upper bound U on the edit distance ED(x,y) that with high probability, satisfies U≤R(ED(x,y)+n1−ζ). In particular, on any input with ED(x,y)≥n1−ζ the algorithm outputs a constant factor approximation with high probability. A similar result has been proven independently by Brakensiek and Rubinstein (2019). ]]> strings edit-distance proof computational-complexity to-understand consider:looking-to-see consider:visualization https://pinboard.in/ https://pinboard.in/u:Vaguery/b:ba05fdb80253/ 2020-10-03T12:14:28+00:00 https://www.quantamagazine.org/a-new-algorithm-for-graph-crossings-hiding-in-plain-sight-20200915/ Vaguery see-prior-bookmark graph-theory computational-complexity graph-layout rather-interesting algorithms to-write-about to-simulate https://pinboard.in/ https://pinboard.in/u:Vaguery/b:38d10dff7d32/ 2020-10-03T12:12:51+00:00 https://arxiv.org/abs/1911.03449 Vaguery algorithms computational-complexity computational-geometry graph-theory rather-interesting to-understand to-write-about consider:rediscovery consider:representation https://pinboard.in/ https://pinboard.in/u:Vaguery/b:7a3792b8651e/ 2020-09-27T11:59:08+00:00 https://arxiv.org/abs/1712.09617 Vaguery=3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases. This is achieved by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry. ]]> constraint-satisfaction combinatorics computational-complexity to-understand purdy-pitchers hypergraphs visualization https://pinboard.in/ https://pinboard.in/u:Vaguery/b:228fc42310cc/ 2020-07-15T13:46:05+00:00 https://arxiv.org/abs/1703.10293 Vaguery0, then the additive error has to be $\Omega(\eps f)$. This surprisingly matches known upper bounds in the literature. (3) For weighted graphs, we provide matching upper and lower bounds for the single pair case. Namely, the size of the preserver is Θ(n2) for f≥2 in both directed and undirected graphs, while for f=1 the size is Θ(n) in undirected graphs. For directed graphs, we have a superlinear upper bound and a matching lower bound. Most of our lower bounds extend to the distance oracle setting, where rather than a subgraph we ask for any compact data structure. ]]> network-theory robustness rather-interesting algorithms computational-complexity graph-theory to-write-about to-simulate consider:looking-to-see consider:feature-discovery https://pinboard.in/ https://pinboard.in/u:Vaguery/b:2475359bbfb8/ 2020-07-10T11:27:31+00:00 https://arxiv.org/abs/2001.09575 Vaguery computational-geometry extreme-values rather-interesting looking-to-see computational-complexity operations-research consider:looking-to-see to-simulate consider:oriented-gradients https://pinboard.in/ https://pinboard.in/u:Vaguery/b:f739ddbc1403/ 2020-07-09T23:29:24+00:00 https://arxiv.org/abs/2006.03045 Vaguery information-theory online-learning optimization no-backsies algorithms rather-interesting computational-complexity to-simulate to-write-about consider:animation consider:working-up-to-it consider:performance-measures https://pinboard.in/ https://pinboard.in/u:Vaguery/b:b5ac353a0001/ 2020-05-30T14:07:26+00:00 https://arxiv.org/abs/1803.08621 Vaguery data-structures database computational-complexity computational-geometry rather-interesting algorithms to-understand to-write-about to-simulate consider:off-axis https://pinboard.in/ https://pinboard.in/u:Vaguery/b:843cb9a19680/ 2020-05-23T11:31:07+00:00 https://arxiv.org/abs/1902.05720 Vaguery cellular-automata computational-complexity to-understand formal-languages representation algorithms classification https://pinboard.in/ https://pinboard.in/u:Vaguery/b:f6d3accd85a0/ 2020-05-22T21:33:57+00:00 https://arxiv.org/abs/1702.06976 Vaguery machine-learning benchmarking matrices rather-interesting to-write-about nudge-targets consider:representation consider:ReQ algorithms computational-complexity https://pinboard.in/ https://pinboard.in/u:Vaguery/b:d40bd17995ea/ 2020-05-22T21:22:08+00:00 https://arxiv.org/abs/1705.01595 Vaguery graph-theory feature-construction computational-complexity algorithms rather-interesting heuristics to-write-about to-simulate consider:representation consider:slow-algorithms-but-obvious https://pinboard.in/ https://pinboard.in/u:Vaguery/b:47778c23cce3/ 2020-05-17T22:22:25+00:00 https://arxiv.org/abs/1804.02075 Vaguery graph-theory algorithms robustness error-correction rather-interesting to-write-about computational-complexity to-simulate consider:graph-structure https://pinboard.in/ https://pinboard.in/u:Vaguery/b:b450a0214352/