Hub · Weitere Werkzeuge

Datenvertragswerk

202 veröffentlichte Endpunkt-URLs. Methoden, Preise, Eingaben und Originaldokumentation auf jeder Detailseite.

datenvertrag.halowerk.com · Katalogstand 2026-11-07, 02:42 UTC

Endpunkte

121–180 von 202

Datenvertragswerk0,003 USDC
multiset permutation index audit
POSThttps://datenvertrag.halowerk.com/v1/multiset-permutation-index-audit
Own bounded exact multinomial-prefix rank/unrank for numeric labels0..k-1, total multiplicity<=12. Return distinct permutation count, supplied wholeword rank, selected word at requested rank and complete selection-block trace; compare entir
Datenvertragswerk0,003 USDC
mycielski construction edge lineage
POSThttps://datenvertrag.halowerk.com/v1/mycielski-construction-edge-lineage
From a supplied simple undirected graph with1..8vertices labelled0..n-1,construct one whole Mycielski lift with original vertices0..n-1,clone n+v for each vertexv and apex2n. Retain every originaledge{a,b},add both crossedges{a,n+b}and{b,n+
Datenvertragswerk0,003 USDC
noncrossing partial matching inventory
POSThttps://datenvertrag.halowerk.com/v1/noncrossing-partial-matching-inventory
For 0 to 7 ordered points labelled from zero, enumerate all partial matchings: each point is paired at most once and arcs (i,j),(k,l) cannot have i<k<j<l. Nested pairs and unmatched singletons are allowed. Return every sorted pair list, sin
Datenvertragswerk0,003 USDC
open ear decomposition family
POSThttps://datenvertrag.halowerk.com/v1/open-ear-decomposition-family
For one FULLY CAPTURED labelled simple undirected graph n1..4 on0..n-1, reconstruct EVERY ordered OPEN EAR DECOMPOSITION covering ALL originaledges and ALL originalvertices. edge_mask bitk encodes unorderedpair(u,v),u<v, in numeric lexorder
Datenvertragswerk0,003 USDC
optimal golomb ruler inventory audit
POSThttps://datenvertrag.halowerk.com/v1/optimal-golomb-ruler-inventory-audit
For2..6 anonymous marks, return all globally shortest integer Golomb rulers startingat0 with every positive pairdistance unique. Quotient reflection by choosing lexicographically smaller markvector; rulers lexsorted. Return full(i,j,distanc
Datenvertragswerk0,003 USDC
optimal key search tree audit
POSThttps://datenvertrag.halowerk.com/v1/optimal-key-search-tree-audit
Own exact intervalDP on ordered keyranks0..n-1,n<=8. Keys are INTERNAL successnodes with rootdepth/comparisoncost1, not ordered leafdecisiontree. Return minimumweightedcost,countalloptimalBSTshapes,lexleastpreorder,parents,comparisondepths,
Datenvertragswerk0,003 USDC
orientable rotation system genus family
POSThttps://datenvertrag.halowerk.com/v1/orientable-rotation-system-genus-family
For a fully captured CONNECTED simple undirected graph on1..4 labels0..n-1, generate EVERY cyclic neighbor order at every vertex. Fix the smallest neighbor first in each cycle; retain mirrored orders and original labels, no graphisomorphism
Datenvertragswerk0,003 USDC
packbits row reconstruction audit
POSThttps://datenvertrag.halowerk.com/v1/packbits-row-reconstruction-audit
Own bounded TIFF6PackBits normalized-row decoder: unsigned0..127literal,129..255replicate,128noop; each row independently bounded. Return all complete-operation decoded prefixes, consumed offsets and literal/replicate/noop witnesses; compar
Datenvertragswerk0,003 USDC
page index joint scan intervals
POSThttps://datenvertrag.halowerk.com/v1/page-index-joint-scan-intervals
Two original decoded flat Parquet int-column page bounds and first-row offsets plus two range predicates reconstruct joint conservative scan intervals. Interval intersection in production; independent row-enumeration reference. One row grou
Datenvertragswerk0,003 USDC
pair distance turnpike inventory
POSThttps://datenvertrag.halowerk.com/v1/pair-distance-turnpike-inventory
Given2..6distinct integer points and the complete positive pair-distance multiset with span<=20, enumerate all normalized point sets starting0, quotient reflection by lexicographic minimum. Return every ordered pair distance and input dista
Datenvertragswerk0,003 USDC
pair minimal vertex separator inventory
POSThttps://datenvertrag.halowerk.com/v1/pair-minimal-vertex-separator-inventory
For a supplied simple undirected graph on1..6 labelled vertices, return ALL vertex sets S that minimally separate some nonadjacent terminal pair: no proper subset of S separates that pair. Give every numerically sorted separator mask and ve
Datenvertragswerk0,003 USDC
palindromic occurrence tree audit
POSThttps://datenvertrag.halowerk.com/v1/palindromic-occurrence-tree-audit
For supplied0..32 numeric symbols0..2, constructs every distinct nonempty palindromic factor with its full tokenword, longestproper palindromesuffix link, all inclusive0based occurrence endindices and labeled wraptransitions. Returns longes
Datenvertragswerk0,003 USDC
parking preference fiber inventory
POSThttps://datenvertrag.halowerk.com/v1/parking-preference-fiber-inventory
Given one original permutation ofslots1..n assigned tocar1..n,n0..6, synthesize ALL preferencevectors which, under classical one-way parking, produce exactly that assignment. Each car starts at its preference and takes first free slot at-or
Datenvertragswerk0,003 USDC
partial cube cut coordinate embedding
POSThttps://datenvertrag.halowerk.com/v1/partial-cube-cut-coordinate-embedding
For a fully captured simple undirected graph on original vertex labels0..n-1, n1..5, edge_mask bits name lexicographic pairs(0,1),(0,2),.,(n-2,n-1). Return full shortest-path distances, using null for disconnected pairs. is_partial_cube is
Datenvertragswerk0,003 USDC
partial latin completion family
POSThttps://datenvertrag.halowerk.com/v1/partial-latin-completion-family
For one FULLY CAPTURED indexed squareCLUEGRID of order1..3, with AT MOST4filledcells, reconstruct EVERY complete LATIN SQUARE agreeingwithALLgivenclues. cells is a flatROWMAJORarray ofexactlyorder*order entries; -1 is a KNOWN unfilledpositi
Datenvertragswerk0,003 USDC
partition core quotient ledger
POSThttps://datenvertrag.halowerk.com/v1/partition-core-quotient-ledger
For a nonincreasing positive integer partition of total0..12 and modulusr2..5, construct its whole r-core and ordered r-tuple of quotient partitions. Canonical convention pads beta numbers to the smallest multiple of r at least the number o
Datenvertragswerk0,003 USDC
partition hook multiset inverse family
POSThttps://datenvertrag.halowerk.com/v1/partition-hook-multiset-inverse-family
Given an original multiset of0..20positive hooklengths each1..20, reconstruct EVERY integer partition of that cellcount whose English Ferrers diagram has exactly that hookmultiset. Hook counts self plus cells strictlyright and strictlybelow
Datenvertragswerk0,003 USDC
pathwidth optimal layout inventory
POSThttps://datenvertrag.halowerk.com/v1/pathwidth-optimal-layout-inventory
For an original labelled simple undirected graph n0..5 including disconnected and empty graphs, derive minimum outside-prefix vertex frontier size over ALL permutations. Return exact pathwidth, ALL minimizing orders in numeric lexicographic
Datenvertragswerk0,003 USDC
perfect elimination order family
POSThttps://datenvertrag.halowerk.com/v1/perfect-elimination-order-family
For one FULLY CAPTURED labelled simple undirected graph n0..5 on0..n-1, reconstruct EVERY PERFECT ELIMINATION ORDER of its ORIGINAL vertices without adding graph edges. edge_mask bitk encodes pair(u,v),u<v, in numeric lexorder. An order P d
Datenvertragswerk0,003 USDC
permutation cycle record bijection ledger
POSThttps://datenvertrag.halowerk.com/v1/permutation-cycle-record-bijection-ledger
For an original permutation P of0..n-1,n0..7, follow directed map cycles, rotate each cycle to its largest value, order cycles by increasing largest value, and erase parentheses. Return that entire transformed word, all canonical cycles, ze
Datenvertragswerk0,003 USDC
permutation square root inventory audit
POSThttps://datenvertrag.halowerk.com/v1/permutation-square-root-inventory-audit
For a supplied permutation of1..7anonymous labels0..n-1, reconstruct every permutation q with q[q[i]]=p[i], lexicographically sorted, complete canonical source cycles and root count. Compare the entire ordered claimed-root inventory; null i
Datenvertragswerk0,003 USDC
pgoutput transaction scope audit
POSThttps://datenvertrag.halowerk.com/v1/pgoutput-transaction-scope-audit
Reconstruct bounded nonstreaming Begin/Commit transaction scopes and check Origin-before-DML plus announced-relation use in supplied normalized pgoutput messages. Null capture stops interpretation; earlier contradictions survive. No binary
Datenvertragswerk0,003 USDC
planar lattice cone hilbert basis
POSThttps://datenvertrag.halowerk.com/v1/planar-lattice-cone-hilbert-basis
From two original primitive integer rays left/right with coordinates0..4 in the firstquadrant and positive determinant, construct the unique Hilbert basis: ALL nonzero latticepoints in their rational cone that cannot split as sum of two non
Datenvertragswerk0,003 USDC
planar lattice voronoi cell
POSThttps://datenvertrag.halowerk.com/v1/planar-lattice-voronoi-cell
From two independent integer basisvectors withcoordinates-2..2 construct the unbounded periodic lattice and return its WHOLE bounded Euclidean Voronoi cell atorigin: all rationalvertices counterclockwise startingatlexicographicallyleast(x,y
Datenvertragswerk0,003 USDC
pointstamp completion audit
POSThttps://datenvertrag.halowerk.com/v1/pointstamp-completion-audit
A streaming-runtime fixture maintainer checks whether claimed blocked/unblocked completion requests follow from a reconciled global capability/message stock and a supplied finite graph of product-time location summaries. Additive two-coordi
Datenvertragswerk0,003 USDC
poisson binomial distribution audit
POSThttps://datenvertrag.halowerk.com/v1/poisson-binomial-distribution-audit
Own bounded BigInt polynomial convolution for <=12supplied Bernoulli marginals, denominators<=100; output reduced exact rational PMF/CDF and expectation; compare whole supplied PMF by rational equality. Independence must be explicitly suppl
Datenvertragswerk0,003 USDC
positive row graver basis
POSThttps://datenvertrag.halowerk.com/v1/positive-row-graver-basis
Given ONE indexed positive integer weight row a of length1..3, each weight1..3, reconstruct its ENTIRE Graver basis: every nonzero integer vector z with sum(a[i]*z[i])=0 that has no distinct nonzero kernelvector u conformally below it (same
Datenvertragswerk0,003 USDC
precedence order index ledger
POSThttps://datenvertrag.halowerk.com/v1/precedence-order-index-ledger
For0..8anonymousvertices and completeDAGprecedenceedges, rank suppliedpermutation among alllexsortedtopologicalorders and independentlyunrank suppliedindex. Return exacttotal, fullorders and everycandidatevertex/completioncount at eachprefi
Datenvertragswerk0,003 USDC
prefix function source word family
POSThttps://datenvertrag.halowerk.com/v1/prefix-function-source-word-family
Given a whole prefix_table of length0..6 with integer0<=prefix_table[i]<=i, reconstruct EVERY word over the FIXED labelled alphabet0,1,2 whose prefix function equals that vector exactly. Entryi is the MAXIMUM length k<i+1 for which the firs
Datenvertragswerk0,003 USDC
prepost binary tree fiber inventory
POSThttps://datenvertrag.halowerk.com/v1/prepost-binary-tree-fiber-inventory
For two permutations of the same anonymous labels0..n-1,n0..5, reconstruct ALL ordered binary trees with exactly the supplied root-left-right preorder and left-right-root postorder. Unary children may be left or right; do not assume uniquen
Datenvertragswerk0,003 USDC
prescribed outdegree orientation inventory
POSThttps://datenvertrag.halowerk.com/v1/prescribed-outdegree-orientation-inventory
For a fully captured labelled simple undirected graph on0..n-1,n0..4, and supplied exact outgoing-degree demands b_i in0..n-1, reconstruct ALLedge orientations meeting every demand. Zero bit on canonical edge(u<v) directs u to v; one bit re
Datenvertragswerk0,003 USDC
prime field discrete log ledger
POSThttps://datenvertrag.halowerk.com/v1/prime-field-discrete-log-ledger
For supplied prime modulus2..251, nonzero basis and target residue, returns exact multiplicative order, all powers in exponent order0..order-1, target subgroup membership and canonical least nonnegative discrete logarithm if one exists. Tar
Datenvertragswerk0,003 USDC
prime power root forest audit
POSThttps://datenvertrag.halowerk.com/v1/prime-power-root-forest-audit
For integerpolynomial coefficients in ascendingpowers, p2/3/5 and exponents1..3, reconstruct ALL residue roots at everyprimepower, including singular0/1/p-child branches and deadends. Return orderedlevels and everyparent with derivative/quo
Datenvertragswerk0,003 USDC
primitive quadratic class inventory
POSThttps://datenvertrag.halowerk.com/v1/primitive-quadratic-class-inventory
For an original negative discriminant D from-160through-3 with D congruent0or1mod4, reconstruct the complete primitive positive definite binary quadratic form class inventory. Return every integer[a,b,c] for ax^2+bxy+cy^2 with b^2-4ac=D,gcd
Datenvertragswerk0,003 USDC
proposer optimal stable matching audit
POSThttps://datenvertrag.halowerk.com/v1/proposer-optimal-stable-matching-audit
For two equally sized sides n1..6 with complete strict preference permutations, independently runs deferred acceptance from each side. Returns both entire left-indexed assignments and each side personal rank vectors, and whether the stable
Datenvertragswerk0,003 USDC
prufer tree reconstruction audit
POSThttps://datenvertrag.halowerk.com/v1/prufer-tree-reconstruction-audit
Own bounded Prufer bijection decoder on labels0..n-1,n2..32. Return all canonical undirected edges, original degrees and smallest-leaf elimination trace, then compare whole claimed edge multiset ignoring endpoint orientation/list order. Dup
Datenvertragswerk0,003 USDC
quadratic surd periodic continued fraction
POSThttps://datenvertrag.halowerk.com/v1/quadratic-surd-periodic-continued-fraction
For the POSITIVE square-root branch value x=(sqrt(d)+p)/q with nonsquare integer d2..31, integer p−2..2 and positive q1..3, reconstruct its canonical regular continued fraction by floor then reciprocal fractionalpart. Return the shortest pr
Datenvertragswerk0,003 USDC
quadtree face balance refinement ledger
POSThttps://datenvertrag.halowerk.com/v1/quadtree-face-balance-refinement-ledger
From an original FULL partition of the logical unit square into prefixfree quadtree leafcodes, derive the unique coarsest refinement with face-neighbor leveldifference at most1 (side ratio at most2). Only positive-length shared faces count;
Datenvertragswerk0,003 USDC
ramanujan gcd class projection
POSThttps://datenvertrag.halowerk.com/v1/ramanujan-gcd-class-projection
For an original period vector length1..12 with integers-16..16 at positions0..n-1, project onto the subspace constant on gcd(position,n) classes. Return every positive divisor q of n in ascending order,phi(q),the whole integer Ramanujan-sum
Datenvertragswerk0,003 USDC
rational polynomial bezout ledger
POSThttps://datenvertrag.halowerk.com/v1/rational-polynomial-bezout-ledger
For twointegerpolynomials degree<=3 in ascendingpowers, return monicQ[x]gcdG, exactA/G,B/G and rationalS,T withSA+TB=G. CanonicalS has degree<deg(B/G); B=0 usesS=1/lead(A),T=0; bothzero yieldsallzero(emptyarrays). Wholeidentitycoefficients
Datenvertragswerk0,003 USDC
rational radix expansion audit
POSThttps://datenvertrag.halowerk.com/v1/rational-radix-expansion-audit
For a supplied exact signed rational and base2..16, return integer digits, shortest nonrepeating fractional prefix, minimal repeating block, reduced fraction and full finite remainder-cycle witness, then compare the entire canonical expansi
Datenvertragswerk0,003 USDC
reader row lineage audit
POSThttps://datenvertrag.halowerk.com/v1/reader-row-lineage-audit
An Iceberg-v3 reader fixture maintainer audits inherited row-lineage claims from ordered manifest entries and physical row positions,while retaining explicitly stored lineage values. Pinned Iceberg1.10.0 reader fragment only; semantic null
Datenvertragswerk0,003 USDC
reduced adjacent swap word inventory
POSThttps://datenvertrag.halowerk.com/v1/reduced-adjacent-swap-word-inventory
For a complete permutation of0..n-1,n0..5, construct ALL shortest words of adjacent POSITION swaps which sort it to identity. Each word lists zero-based left positions, applied left-to-right to the supplied source permutation. Return numeri
Datenvertragswerk0,003 USDC
rook board placement polynomial
POSThttps://datenvertrag.halowerk.com/v1/rook-board-placement-polynomial
For a complete binary board with0to4rows and0to4columns, enumerate all placements using only allowed1cells, with at most one rook per row and per column. Return the complete coefficient vector r0..rmin(rows,columns), counting each cardinali
Datenvertragswerk0,003 USDC
rooted acyclic orientation family
POSThttps://datenvertrag.halowerk.com/v1/rooted-acyclic-orientation-family
Given one original simple undirected graph on1..5fixedlabels0..n-1 and a specified root, derive ALL acyclic orientations whose ONLY sink is that root. A sink has outdegree0; no extra unique-source requirement and no every-face hypercube USO
Datenvertragswerk0,003 USDC
rooted tree admissible cut coproduct
POSThttps://datenvertrag.halowerk.com/v1/rooted-tree-admissible-cut-coproduct
For a complete rooted tree on1..5 original labels0..n-1, parents[0]=-1 and every other parent is an original label; every vertex must reach root0. Reconstruct the commutative nonplanar Connes-Kreimer coproduct Delta(T)=SUM coefficient*fores
Datenvertragswerk0,003 USDC
rooted triplet tree family
POSThttps://datenvertrag.halowerk.com/v1/rooted-triplet-tree-family
For1..4 taxonlabels0..n-1 and up to12positive rootedtriplets[a,b,c] witha<b andallthreedistinct, construct ALL fullbinaryrootedtrees displaying everyab|c: lca(a,b)strictlybelow lca(a,c)=lca(b,c). Tripletorder/duplicates irrelevant. Everytax
Datenvertragswerk0,003 USDC
sandpile group addition table ledger
POSThttps://datenvertrag.halowerk.com/v1/sandpile-group-addition-table-ledger
For an original connected simple undirected labelled graph with0..3nonsink vertices0..n-1 and sink=n, reconstruct its whole finite recurrent sandpile GROUP. Return every recurrent stable chipvector in numeric lexicographic order as indexed
Datenvertragswerk0,003 USDC
sandpile recurrent configuration inventory
POSThttps://datenvertrag.halowerk.com/v1/sandpile-recurrent-configuration-inventory
From an original loopless undirected multigraph with1..3nonsink vertices and sink at index n, symmetric edge multiplicities0..2 and every vertex connected to sink, enumerate ALL recurrent stable chip configurations in lexicographic order. R
Datenvertragswerk0,003 USDC
scd2 validity ledger
POSThttps://datenvertrag.halowerk.com/v1/scd2-validity-ledger
Check a bounded corrected dimension history before a data agent publishes it. Caller-supplied pseudonyms/hashes only; no external identity claim. Conflicting selected hashes yield not_observed; missing coverage yields unknown. A schema-vali
Datenvertragswerk0,003 USDC
semistandard shape weight family
POSThttps://datenvertrag.halowerk.com/v1/semistandard-shape-weight-family
For an original partition shape with at most7cells and exactly three nonnegative content counts summing to that size, reconstruct ALL semistandard Young tableaux on letters1,2,3. English convention: longer left-aligned rows above, rows weak
Datenvertragswerk0,003 USDC
serial order cycle audit
POSThttps://datenvertrag.halowerk.com/v1/serial-order-cycle-audit
Reconstruct complete RFC1982 serial comparisons from original finite snapshot-value domains: equal/less/greater/undefined, every half-circle incomparable pair, every directed triangle witness and indices not older than every value under def
Datenvertragswerk0,003 USDC
serial32 update replay
POSThttps://datenvertrag.halowerk.com/v1/serial32-update-replay
Apply RFC1982 wrapped32bit serial ordering to a supplied finite accept-strictly-newer receiver policy. Return every checked proposal, known accepted-prefix count and state; ignore equal/older proposals. Half-space ordering is undefined and
Datenvertragswerk0,003 USDC
set partition index ledger
POSThttps://datenvertrag.halowerk.com/v1/set-partition-index-ledger
For set0..size-1,size0..8, rank a suppliedcanonical restrictedgrowthword in lexorder and independentlyunrank suppliedindex. Blocklabels are orderedbyfirstappearance; a_i<=1+max earlier. Return Belltotal, fullwords/blockmemberships and bothc
Datenvertragswerk0,003 USDC
shortest addition chain audit
POSThttps://datenvertrag.halowerk.com/v1/shortest-addition-chain-audit
Own complete all-pair-addition breadth-first search for target1..16. Return globally minimum multiplicationcount, countofdistinct optimal exponentsequences, lexleastoptimalchain and leastindexpair perstep. Operanddecomposition alternatives
Datenvertragswerk0,003 USDC
shortest binary superstring inventory
POSThttps://datenvertrag.halowerk.com/v1/shortest-binary-superstring-inventory
For0to4 binary input words of length1to3, construct ALL minimum-length strings containing each original word as a contiguous substring. Solutions sort lexicographically. Return each entire solution and every overlapping zero-based start off
Datenvertragswerk0,003 USDC
shortest bounded unit fraction family
POSThttps://datenvertrag.halowerk.com/v1/shortest-bounded-unit-fraction-family
From an original nonnegative rational numerator0..16/denominator1..32 and maximum denominator1..12, derive ALL minimum-cardinality subsets of distinct denominators from1..ceiling whose reciprocal sum equals the normalized target. Each famil
Datenvertragswerk0,003 USDC
shortest common supersequence family
POSThttps://datenvertrag.halowerk.com/v1/shortest-common-supersequence-family
Given two original binary words each length 0..4, construct ALL distinct minimum-length words that contain BOTH originals as subsequences (gaps allowed). Return lexicographically sorted family, exact minimum length/count and zero-based lexi
Datenvertragswerk0,003 USDC
shortest state distinguishing experiment family
POSThttps://datenvertrag.halowerk.com/v1/shortest-state-distinguishing-experiment-family
Given two permutation actions on 1..4 labelled states and a binary Moore output for each state, synthesize ALL shortest fixed binary input words whose complete output traces distinguish every ORIGINAL starting state. Observe the initial out
Datenvertragswerk0,003 USDC
signed graph minimum frustration inventory
POSThttps://datenvertrag.halowerk.com/v1/signed-graph-minimum-frustration-inventory
Given an original labelled simple undirected signed graph on0..6vertices andatmost10orderededges [u,v,sign], reconstruct the frustration index and ALLminimumcardinality edgeindex deletion sets leaving every cycle positive. Require u<v and u