| erikjanvl.nl | T: Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | deterministic polynomial, polynomial kernel, quasi polynomial, polynomial time, structure polynomial | graph, algorithm, pp, complexity, planar | 14 |
| rolandvdv.nl | A cabling formula for the colored Jones polynomial, Oberwolfach Low-Dimensional Topology and Number Theory, (2010), p. 2101–2163. | jones polynomial, polynomial solvable, natan polynomial, polynomial time, knot polynomial | topology, fall, geometry, quantum, dimensional | 9 |
| relindejurrius.nl | December 4, 2008 - The Tutte polynomial and the extended weight enumerator. Seminar on Graphs and Matroids. Eindhoven, The Netherlands. | tutte polynomial, polynomial intercity, invariant polynomial, polynomial colloquium, polynomial matroid | mathematics, geometry, conference, theory, finite | 7 |
| gqt.nl | Orthogonal polynomials, in particular those that come as special cases of generalized hypergeometric functions, are a unique enterprise that unifies all ... | orthogonal polynomial, polynomial event, polynomial particular | geometry, theory, quantum, colloquium, conference | 2 |
| jhellings.nl | First, we show that query evaluation of CCFPQ has polynomial time data complexity. Secondly, we look at the generalization of regular expressions, as used in CRPQ , to regular relations and show how similar generalizations can be applied… | ccfpq polynomial, polynomial time | query, resilient, fault, thesis, finally | 1 |
| tvandijk.nl | I continue designing algorithms that solve parity games. Hopefully one of these runs in polynomial time. My algorithms mostly use the tangle attractor to partition a parity game and its subgames into smaller regions, learning new tangles… | run polynomial, polynomial time | decision, tangle, algorithm, binary, topic | 1 |
| rubenvannieuwpoort.nl | Linear congruential generators… The Fowler-Noll-Vo hash… Button debouncing… | | february, january, approximation, euler, root | 0 |
| davdata.nl | Welcome at DavData , the website for: | good polynomial, polynomial set | puzzle, programming, math, calculation, geometry | 0 |
| joostrijneveld.nl | Andreas Hülsing, Joost Rijneveld, and Peter Schwabe. ARMed SPHINCS – Computing a 41 KB signature in 16 KB of RAM. Public-Key Cryptography – PKC 2016 , LNCS 9614, pp. 446-470, Springer, 2016. | fast polynomial, polynomial multiplication | write, signature, quantum, implementation, schwabe | 0 |
| intelec.nl | …supplied thousands of Engineers, with the integral IS-CableNet + IEC 60364 application, including IS-CAD (+) IEC-60617. Download and evaluate the eXpress Trial version of this advanced, money and time saving Power Engineering application. | database polynomial | cable, calculation, integral, actual, documentation | 0 |