Hub · More Tools
Datenvertragswerk
340 published endpoint URLs. Methods, prices, inputs and original documentation on every detail page.
datenvertrag.halowerk.com · Catalog updated 2026-11-17 UTC
Endpoints
301–340 of 340- Datenvertragswerk0.003 USDC
set partition index ledger
POSThttps://datenvertrag.halowerk.com/v1/set-partition-index-ledgerFor the set 0..size-1 (size 0..8), ranks a supplied canonical restricted growth word in lex order and independently unranks a supplied index. Block labels are ordered by first appearance (a_i<=1+max earlier). Returns the Bell total, the ful
- Datenvertragswerk0.003 USDC
shortest addition chain audit
POSThttps://datenvertrag.halowerk.com/v1/shortest-addition-chain-auditRuns a complete all-pair-addition breadth-first search for a target 1..16 and returns the globally minimum multiplication count of an addition chain, the count of distinct optimal exponent sequences, the lex-least optimal chain and the leas
- Datenvertragswerk0.003 USDC
shortest binary superstring inventory
POSThttps://datenvertrag.halowerk.com/v1/shortest-binary-superstring-inventoryFor0to4 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-familyFrom 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-familyGiven 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-familyGiven 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-inventoryGiven a labelled simple undirected signed graph on 0..6 vertices with at most 10 ordered edges [u,v,sign] (u<v, sign +1 or -1), reconstructs the frustration index and all minimum-cardinality edge-index deletion sets that leave every cycle p
- Datenvertragswerk0.003 USDC
simplicial gradient matching family
POSThttps://datenvertrag.halowerk.com/v1/simplicial-gradient-matching-familyFrom one complete abstract simplicial complex on labels 0..n-1 (n 0..4, dimension <=2, at most 8 nonempty faces), given as face_mask with bit (s-1) for vertex subset s, generates every acyclic partial matching of its nonempty face Hasse dia
- Datenvertragswerk0.003 USDC
simultaneous core partition family
POSThttps://datenvertrag.halowerk.com/v1/simultaneous-core-partition-familyFor supplied coprime positive integers a,b each1..5, synthesize EVERY simultaneous(a,b)-core integer partition: no cell hook length is divisible by either parameter. No original partition is supplied. Return all nonincreasing positive rowle
- Datenvertragswerk0.003 USDC
snapshot window collision plan
POSThttps://datenvertrag.halowerk.com/v1/snapshot-window-collision-planCheck which buffered snapshot READ keys may remain after a supplied Debezium-style chunk window so a data consumer does not reapply superseded snapshot rows. Normalized one-chunk metadata only;no connector,SQL call or full-table truth. Miss
- Datenvertragswerk0.003 USDC
stable cartesian tree reconstruction audit
POSThttps://datenvertrag.halowerk.com/v1/stable-cartesian-tree-reconstruction-auditFrom1..24 supplied integer values construct the unique min-Cartesian tree with priority(value,originalindex), inorder0..n-1. Return every parent/left/right/root, half-open subtree range and inclusive-endpoint range-argmin triangular table.
- Datenvertragswerk0.003 USDC
stable matching family inventory
POSThttps://datenvertrag.halowerk.com/v1/stable-matching-family-inventoryFor two equal sets0..n-1,n0..5, with complete strict partner-preference permutations, synthesize ALL stable full bijections. A blocking pair strictly prefers each other to their assigned partners. Return every left-indexed partner vector in
- Datenvertragswerk0.003 USDC
stable matching rotation lattice
POSThttps://datenvertrag.halowerk.com/v1/stable-matching-rotation-latticeGiven complete strict left and right preference permutations on the same 1..4 participants, enumerate every stable perfect matching lexicographically, the left-dominance Hasse covers and distinct cover rotations as ordered [left,old_right,n
- Datenvertragswerk0.003 USDC
stack sort permutation image
POSThttps://datenvertrag.halowerk.com/v1/stack-sort-permutation-imageCompute the full image of one captured permutation under one pass of the deterministic West stack-sorting map. Read the word from left to right. Before pushing a new value, pop every smaller stack top into the output; after the final input,
- Datenvertragswerk0.003 USDC
stack sort preimage inventory
POSThttps://datenvertrag.halowerk.com/v1/stack-sort-preimage-inventoryGiven a target permutation of 0..n-1 (n 0..7), reconstructs all source permutations mapped to it by one deterministic stack-sort pass (while top < next input pop to output, then push the input; drain after the final input). Returns every so
- Datenvertragswerk0.003 USDC
standard tableau evacuation ledger
POSThttps://datenvertrag.halowerk.com/v1/standard-tableau-evacuation-ledgerFor one English-convention straight standard Young tableau with 0..8 cells labelled 1..n exactly once, constructs its Schuetzenberger evacuation: repeatedly remove 1, slide the smaller right/below neighbor into the hole to an outer corner,
- Datenvertragswerk0.003 USDC
standard tableau promotion orbit ledger
POSThttps://datenvertrag.halowerk.com/v1/standard-tableau-promotion-orbit-ledgerFor one straight standard Young tableau with 0..8 cells labelled 1..n (English row convention), iterates remove-minimum promotion: remove 1, slide the smaller right/below neighbor into the hole until an outer corner, put n+1 there, subtract
- Datenvertragswerk0.003 USDC
stirling permutation index ledger
POSThttps://datenvertrag.halowerk.com/v1/stirling-permutation-index-ledgerFor order n 0..6, works on Stirling permutations: words in which each label 1..n occurs exactly twice and every value between the two copies of i exceeds i. Ranks a supplied word in numeric lexicographic order among only these words and ind
- Datenvertragswerk0.003 USDC
stirling second kind sequence prefix
POSThttps://datenvertrag.halowerk.com/v1/stirling-second-kind-sequence-prefixComputes the complete second-kind Stirling transform of one signed integer prefix a0,.,aL-1 (L 0..6, each entry -1, 0 or 1): b_n=sum for k 0..n of S(n,k)*a_k for every n 0..L-1, where S(n,k) counts partitions of n labelled elements into k n
- Datenvertragswerk0.003 USDC
strong orientation family
POSThttps://datenvertrag.halowerk.com/v1/strong-orientation-familyFor a fully captured simple undirected graph on1..4 original labels0..n-1, construct ALL orientations in which every vertex can reach every other by directed paths. Return lexicographically sorted edge_order(u<v), ascending orientation_mask
- Datenvertragswerk0.003 USDC
subsequence deck word reconstruction family
POSThttps://datenvertrag.halowerk.com/v1/subsequence-deck-word-reconstruction-familyGiven a length n in 0..8, k in 0..n and a full k-deck as distinct binary word/count entries, reconstructs every binary n-word whose multiset of all length-k subsequences equals that deck exactly; multiplicities count index selections. Retur
- Datenvertragswerk0.003 USDC
substring endpos automaton ledger
POSThttps://datenvertrag.halowerk.com/v1/substring-endpos-automaton-ledgerFor 0..32 numeric tokens 0..2, reconstructs all nonempty substring endpos-equivalence classes plus the root, sorted by (max length, longest representative). Returns for every state the length interval, representative, end positions, suffix
- Datenvertragswerk0.003 USDC
symmetric function schur plethysm
POSThttps://datenvertrag.halowerk.com/v1/symmetric-function-schur-plethysmCompute the COMPLETE ordinary OUTER Schur plethysm s_lambda[s_mu] over QQ in the stable symmetric-function ring. outer_partition is lambda and inner_partition is mu. Each source partition is exactly[1],[2],or[1,1], so source sizes1..2 and t
- Datenvertragswerk0.003 USDC
symmetric group kronecker decomposition
POSThttps://datenvertrag.halowerk.com/v1/symmetric-group-kronecker-decompositionFor two original partitions left/right of the SAME integer n0..5, synthesize the COMPLETE internal Kronecker tensor-product decomposition of the corresponding irreducible representations of S_n. Partition arrays have positive integer parts
- Datenvertragswerk0.003 USDC
synchronizing road coloring family
POSThttps://datenvertrag.halowerk.com/v1/synchronizing-road-coloring-familyFor one FULLY CAPTURED directed multigraph on original vertices0..n-1,n1..3, with EXACTLY TWO outgoing EDGE RECORDS per vertex, generate EVERY SYNCHRONIZING ROAD COLORING by alphabet a=0,b=1. Input targets[v] lists the two record targets in
- Datenvertragswerk0.003 USDC
tamari interval tree family
POSThttps://datenvertrag.halowerk.com/v1/tamari-interval-tree-familyFor two ordered full binary trees LOWER and UPPER with the same internal node count 0..4, coded as 0 for a leaf and (LR) for an internal node, reconstructs the entire directed Tamari order interval under the reassociation ((A B) C) -> (A (B
- Datenvertragswerk0.003 USDC
tournament banks maximal transitive choice set
POSThttps://datenvertrag.halowerk.com/v1/tournament-banks-maximal-transitive-choice-setConstructs the Banks choice set of a complete tournament on labels 0..n-1 (n 1..5): the tops of all inclusion-maximal transitive subtournaments (Brandt/Grundbacher Section 2). Input is orientation_mask, where bit 1 means the lower label dom
- Datenvertragswerk0.003 USDC
trace monoid foata normalization
POSThttps://datenvertrag.halowerk.com/v1/trace-monoid-foata-normalizationGiven original generator word and an explicit symmetric irreflexive independence relation, reconstruct its entire Cartier-Foata normal form, occurrence-indexed heights, all forward dependence edges and lexicographically least word in the ad
- Datenvertragswerk0.003 USDC
transaction fragment rank audit
POSThttps://datenvertrag.halowerk.com/v1/transaction-fragment-rank-auditCheck a supplied multi-collection CDC transaction fragment set against END event counts and coupled global/per-collection ordinal positions before downstream assembly. Caller groups normalized fragments first;raw BEGIN/END IDs are never inf
- Datenvertragswerk0.003 USDC
tree centroid branch ledger
POSThttps://datenvertrag.halowerk.com/v1/tree-centroid-branch-ledgerFor a supplied simple connected undirected tree on1..32vertices labelled0..n-1, return a complete per-vertex deletion ledger:each adjacent neighbor in ascending order and the remaining component size reached through it,largest component,min
- Datenvertragswerk0.003 USDC
tree isotonic regression
POSThttps://datenvertrag.halowerk.com/v1/tree-isotonic-regressionCompute the unique weighted least-squares fit on a captured rooted tree: minimize sum weights[i]*(fit[i]-values[i])^2 subject to fit[parent[i]] <= fit[i]. Return the entire fit and objective as reduced numerator/denominator strings, maximal
- Datenvertragswerk0.003 USDC
triangle complex shelling order family
POSThttps://datenvertrag.halowerk.com/v1/triangle-complex-shelling-order-familyFrom a triangle_mask selecting at most four distinct triangles among the ten lexicographic 3-subsets of labels 0..4 (bit0=012, bit1=013, ., bit9=234), generates every complete facet shelling order of the generated simplicial complex. A perm
- Datenvertragswerk0.003 USDC
tunstall optimal phrase dictionary family
POSThttps://datenvertrag.halowerk.com/v1/tunstall-optimal-phrase-dictionary-familyFor positive binary symbol weights [weight0, weight1], each 1..4, and an exact leaf count 2..7, constructs all full binary prefix phrase dictionaries that maximize the expected number of consumed source symbols per phrase, for an i.i.d. sou
- Datenvertragswerk0.003 USDC
two rate three color ledger
POSThttps://datenvertrag.halowerk.com/v1/two-rate-three-color-ledgerOwn bounded RFC2698 Informational trTCM replay. Full buckets at time0; integer-second normalized packet events and supplied IP-byte lengths; independent peak/committed refill and color-aware or blind marking. Return every interpreted mark,
- Datenvertragswerk0.003 USDC
two square lattice shell inventory
POSThttps://datenvertrag.halowerk.com/v1/two-square-lattice-shell-inventoryFor an integer norm from 0 to 1024, return every ordered signed integer pair (x,y) satisfying x*x+y*y=norm, sorted by x then y. Partition points by sign changes and coordinate exchange, with canonical nonnegative representative a<=b; return
- Datenvertragswerk0.003 USDC
unmatched component retraction ledger
POSThttps://datenvertrag.halowerk.com/v1/unmatched-component-retraction-ledgerAudit the signed retraction/restoration ledger of structurally unmatched left tuples when supplied left/right bag changes cross the zero-match boundary, before applying a materialized-view delta. Only structural unmatched-extension coeffici
- Datenvertragswerk0.003 USDC
vertex deck reconstruction family
POSThttps://datenvertrag.halowerk.com/v1/vertex-deck-reconstruction-familyFrom n 0..5 and a complete multiset of exactly n unlabelled (n-1)-vertex graph cards, constructs all labelled simple undirected graphs on 0..n-1 with that vertex-deleted deck. A graph code is an adjacency bitmask over the pairs (0,1),(0,2),
- Datenvertragswerk0.003 USDC
wavelet matrix rank select audit
POSThttps://datenvertrag.halowerk.com/v1/wavelet-matrix-rank-select-auditConstruct the complete four-level wavelet matrix for an original0..64item sequence of numeric symbols0..15. Return levelbitmaps, prefixonecounts, zero_counts, stable original-index witnesses, finalpermutation/values and up to8prefixrank plu
- Datenvertragswerk0.003 USDC
window signed digit recoding audit
POSThttps://datenvertrag.halowerk.com/v1/window-signed-digit-recoding-auditFor an anonymous supplied integer(-2147483647..2147483647) and width2..8 reconstruct the entire canonical window nonadjacent signed binary expansion. Return little-endian signed digits, all nonzero positions/count and per-bit exact before/d
- Datenvertragswerk0.003 USDC
word shuffle coefficient family
POSThttps://datenvertrag.halowerk.com/v1/word-shuffle-coefficient-familyFor two supplied binary words of length0..4, construct their full non-overlapping shuffle product: every length-additive word preserving each original as an ordered subsequence, with exact number of left/right interleavings producing it. So