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

61–120 von 202

Datenvertragswerk0,003 USDC
finite metric tight span complex
POSThttps://datenvertrag.halowerk.com/v1/finite-metric-tight-span-complex
For an original1..4point metricmatrix withzerodiagonal,symmetricpositive offdiagonalintegers1..3 andtriangleinequalities(equalityallowed), construct the WHOLEtightspan: every nonemptyboundedface of P={f_i>=0,f_i+f_j>=d_ij}. Diagonalconditio
Datenvertragswerk0,003 USDC
finite monoid group completion
POSThttps://datenvertrag.halowerk.com/v1/finite-monoid-group-completion
From a supplied complete1..5element associative commutative monoid table withidentityelement0,construct its Grothendieck group of formal differences. Pair(a,b) is equivalent(c,d) iff some sourceelementt gives(a+d)+t=(c+b)+t. Return every eq
Datenvertragswerk0,003 USDC
finite monoid karoubi envelope
POSThttps://datenvertrag.halowerk.com/v1/finite-monoid-karoubi-envelope
For a fully captured associative monoid multiplication table on1..4 original labels0..n-1 with identity0, reconstruct its WHOLE Karoubi envelope. table[x][y] means x*y, no commutativity assumed. objects are EVERY idempotent e with e*e=e, as
Datenvertragswerk0,003 USDC
foata major inversion bijection ledger
POSThttps://datenvertrag.halowerk.com/v1/foata-major-inversion-bijection-ledger
For an original permutation of0..n-1,n0..7, construct the whole Foata second fundamental bijection Phi, transforming source majorindex into image inversionnumber. Startingempty, append eachnewletter after blockrotation: if newletter exceeds
Datenvertragswerk0,003 USDC
formal context concept lattice
POSThttps://datenvertrag.halowerk.com/v1/formal-context-concept-lattice
Given 0to5 objects and 0to5 attributes with a complete binary incidence matrix, construct all formal concepts (A,B) where A is exactly the objects sharing every attribute in B and B is exactly the attributes shared by every object in A. Emp
Datenvertragswerk0,003 USDC
free inverse monoid munn tree
POSThttps://datenvertrag.halowerk.com/v1/free-inverse-monoid-munn-tree
For a whole original word of0..6 tokens on0=a,1=a^-1,2=b,3=b^-1 (inverse token is XOR1), reconstruct its Munn tree in the rank2 free-group Cayley tree. vertices are ALL distinct freely reduced ORIGINALPREFIX words including emptyroot[], sor
Datenvertragswerk0,003 USDC
gaussian euclidean trace audit
POSThttps://datenvertrag.halowerk.com/v1/gaussian-euclidean-trace-audit
Reconstruct the entire exact Euclidean division trace for two Gaussian integers, including every quotient/remainder/norm, canonical first-quadrant gcd and unit-rotated Bezout coefficients. Coordinates -128..128; componentwise nearest quotie
Datenvertragswerk0,003 USDC
generated transformation monoid audit
POSThttps://datenvertrag.halowerk.com/v1/generated-transformation-monoid-audit
From0..3 supplied ordered total state maps on degree1..3 states, reconstructs every generated transformation including identity, its shortest lengthlexicographic generatorword and the whole multiplicationtable. Table[i][j] applies i THEN j,
Datenvertragswerk0,003 USDC
global minimum edge cut family
POSThttps://datenvertrag.halowerk.com/v1/global-minimum-edge-cut-family
For a fully captured simple undirected graph on2..5 labels0..n-1, reconstruct ALL bipartitions minimizing crossing-edge COUNT. Every proper nonempty side is represented once by its vertex-bitmask containing vertex0; masks sort ascending. Re
Datenvertragswerk0,003 USDC
gomory hu cut tree ledger
POSThttps://datenvertrag.halowerk.com/v1/gomory-hu-cut-tree-ledger
From an original symmetric loopless capacity matrix on1..5labelled vertices, capacities0..9 including disconnected graphs, synthesize a deterministic Gomory-Hu cut-equivalent tree, all-pairs minimum-cut values and every tree-edge fundamenta
Datenvertragswerk0,003 USDC
graph burning optimal sequence inventory
POSThttps://datenvertrag.halowerk.com/v1/graph-burning-optimal-sequence-inventory
For an original simple undirected labelled graph on0..6vertices, return its minimum number of burning rounds and ALLoptimal ordered sourcevertex sequences in numeric lexicographic order. Eachround chooses one vertex unburned at START of rou
Datenvertragswerk0,003 USDC
graph cutwidth optimal order inventory
POSThttps://datenvertrag.halowerk.com/v1/graph-cutwidth-optimal-order-inventory
For an original labelled simple undirected graph with0..6vertices, minimize over all vertexorders the maximum number of edges with exactly one endpoint in each prefix. Return exact cutwidth, ALLoptimal numeric-lexicographic vertexorders, th
Datenvertragswerk0,003 USDC
graph graceful labeling family
POSThttps://datenvertrag.halowerk.com/v1/graph-graceful-labeling-family
For a supplied labeled simple undirected graph on vertices0..n-1,n1..4 and m originaledges, synthesize ALL injective vertexmaps into integerlabels0..m whose absolute edge differences are exactly1..m. Edges must be unique lexicographically s
Datenvertragswerk0,003 USDC
graph local complementation orbit
POSThttps://datenvertrag.halowerk.com/v1/graph-local-complementation-orbit
For a fully captured simple undirected graph on n1..5 original labels0..n-1, edge_mask bitk encodes the kth pair(i,j),i<j, in numeric lexicographic order. A local complement at vertexv toggles EVERY edge between two DISTINCT current neighbo
Datenvertragswerk0,003 USDC
graph minimum retraction family
POSThttps://datenvertrag.halowerk.com/v1/graph-minimum-retraction-family
For an original labelled simple undirected graph on1..5 vertices0..n-1, construct ALL smallest induced vertex subsets admitting a graph homomorphism retraction: every edge maps to an original edge and every image vertex is fixed. Return min
Datenvertragswerk0,003 USDC
graph modular substitution ledger
POSThttps://datenvertrag.halowerk.com/v1/graph-modular-substitution-ledger
For a supplied simple undirected graph on 1..6 labelled vertices, reconstruct every nonempty module and the complete strong-module tree, maximal children, parallel/series/prime quotient graphs and vertex memberships. Masks use bit i for ver
Datenvertragswerk0,003 USDC
graph pebbling universal threshold ledger
POSThttps://datenvertrag.halowerk.com/v1/graph-pebbling-universal-threshold-ledger
For a fully captured connected simple undirected graph on1..4labels0..n-1, derive for EVERYroot r the minimum q such that EVERY distribution of q nonnegative integer pebbles can send at least one pebble to r. Legal move removes2 from a vert
Datenvertragswerk0,003 USDC
graph relabeling orbit stabilizer
POSThttps://datenvertrag.halowerk.com/v1/graph-relabeling-orbit-stabilizer
For an original labelled simple undirected graph n1..5 with vertices0..n-1, construct EVERY distinct graph obtained by permuting vertex labels, every automorphism as a full old-to-new vertex map, and the whole vertex-orbit partition. Return
Datenvertragswerk0,003 USDC
graph transitive orientation inventory
POSThttps://datenvertrag.halowerk.com/v1/graph-transitive-orientation-inventory
For a supplied simple undirected graph on 1..6 labelled vertices, return every distinct transitive edge orientation as a sorted direction mask over lexicographic (u<v) edge order. A zero bit orients u to v; a one bit orients v to u. Return
Datenvertragswerk0,003 USDC
graph6 record audit
POSThttps://datenvertrag.halowerk.com/v1/graph6-record-audit
Decode a supplied graph6 record of order0..16 into every labeled undirected edge, degree vector, exact upper-triangle bitstream and zero-padding width, and compare the complete supplied graph claim. Optional graph6 header accepted; record e
Datenvertragswerk0,003 USDC
greedy unit fraction expansion ledger
POSThttps://datenvertrag.halowerk.com/v1/greedy-unit-fraction-expansion-ledger
For an original nonnegative proper rational with numerator0..8 and denominator1..64, reconstruct the entire Fibonacci-Sylvester greedy unit-fraction sequence, every reduced post-subtraction remainder, normalized original and independently r
Datenvertragswerk0,003 USDC
hereditary goodstein prefix ledger
POSThttps://datenvertrag.halowerk.com/v1/hereditary-goodstein-prefix-ledger
From an original start integer0..15 and requested0..5steps, construct the classical Goodstein prefix starting base2: write each current value in hereditary base b, replace b by b+1 everywhere including nested exponents, then subtract1. Cano
Datenvertragswerk0,003 USDC
hilbert grid index audit
POSThttps://datenvertrag.halowerk.com/v1/hilbert-grid-index-audit
Return the entire Hilbert index-to-coordinate path and row-major coordinate-to-index table for order0..4 on a2^order square integer grid. Bottom-left origin,yup; order1 path(0,0),(0,1),(1,1),(1,0), explicit recursive orientation. Check both
Datenvertragswerk0,003 USDC
hot index root audit
POSThttps://datenvertrag.halowerk.com/v1/hot-index-root-audit
A PostgreSQL storage/index fixture maintainer checks which supplied page tuple an initial index-root HOT search may actually return,rather than treating every snapshot-visible physical tuple as reachable from that index entry. PostgreSQL18
Datenvertragswerk0,003 USDC
iceberg v2 delete scope
POSThttps://datenvertrag.halowerk.com/v1/iceberg-v2-delete-scope
Check a proposed Iceberg-V2 file-to-delete-file scan scope plan before a data reader applies deletes to supplied snapshot metadata. Pinned bounded V2 FILE-scope profile only; no row matching,file access or deletion. A schema-valid unknown c
Datenvertragswerk0,003 USDC
insertion tableau permutation fiber
POSThttps://datenvertrag.halowerk.com/v1/insertion-tableau-permutation-fiber
Given one original English-convention standard insertion tableau P with0..7cells labelled1..n exactlyonce, return ALL permutations of1..n whose CLASSICAL row-insertion tableau is exactlyP. Rows/columnsstrictlyincrease; rowlengths formpartit
Datenvertragswerk0,003 USDC
instant selector staleness audit
POSThttps://datenvertrag.halowerk.com/v1/instant-selector-staleness-audit
From original ordered synthetic series samples, evaluation times, positive lookback and nonnegative offset reconstruct complete instant-selector source-point selections, suppress latest stale markers without fallback, and resume after a new
Datenvertragswerk0,003 USDC
integer histogram bucket audit
POSThttps://datenvertrag.halowerk.com/v1/integer-histogram-bucket-audit
Own bounded numeric width_bucket evaluator from PostgreSQL18 public rules: equal-width ascending or mirror-descending bins, or strictly increasing integer threshold bins. Returns every row bucket and rational interval boundaries and compare
Datenvertragswerk0,003 USDC
integer marginal table family
POSThttps://datenvertrag.halowerk.com/v1/integer-marginal-table-family
Given1..3 labelled row totals and1..3 labelled column totals, each nonnegative integer vector with sum at most6, construct EVERY nonnegative integer matrix with exactly those margins. Return entire matrix family in ascending row-major lexic
Datenvertragswerk0,003 USDC
integer partition index audit
POSThttps://datenvertrag.halowerk.com/v1/integer-partition-index-audit
For supplied total n0..24, counts all nonincreasing positive-integer partitions and reconstructs zero-based lexicographically descending index. Returns full chosen partition, its Ferrers conjugate and complete skipped/selected branch-count
Datenvertragswerk0,003 USDC
integer range set algebra
POSThttps://datenvertrag.halowerk.com/v1/integer-range-set-algebra
Canonicalize two supplied integer-range collections, merge overlap and integer adjacency, and return complete canonical inputs, union, intersection and left difference with finite or infinite cardinality. Inclusive/exclusive endpoints norma
Datenvertragswerk0,003 USDC
integral maximum flow family
POSThttps://datenvertrag.halowerk.com/v1/integral-maximum-flow-family
For FIXED directed vertices0,1,2,3 with source0/sink3, originalcapacity_mask encodes all12nonlooparcs (u,v) in increasingu thenincreasingv, bit0=(0,1),bit1=(0,2),bit2=(0,3),bit3=(1,0),.,bit11=(3,2). Presentarc has capacity1, absentarc capac
Datenvertragswerk0,003 USDC
ipv4 embedded address bit mapping
POSThttps://datenvertrag.halowerk.com/v1/ipv4-embedded-address-bit-mapping
Apply RFC6052 structural IPv4-embedded address layouts for prefix lengths32/40/48/56/64/96 from a caller-supplied canonical128bit prefix. Embed four IPv4 octets or extract them from a32lowercase-hex IPv6 address, checking prefix and reserve
Datenvertragswerk0,003 USDC
kaprekar four digit basin census
POSThttps://datenvertrag.halowerk.com/v1/kaprekar-four-digit-basin-census
For base2..10 enumerate the ENTIRE fixed4digit integer state space0..base^4-1, always retaining leadingzeros in digit extraction. Kaprekar transition sorts allfourdigits descending minus ascending, evaluated in that base. Return every attra
Datenvertragswerk0,003 USDC
kendall tau b pair ledger
POSThttps://datenvertrag.halowerk.com/v1/kendall-tau-b-pair-ledger
For 2 to 16 supplied paired integer observations, returns all unordered pairs classified as concordant, discordant, x-only tied, y-only tied or jointly tied, exact tie-corrected tau-b numerator/sqrt(denominator_squared), sign and reduced sq
Datenvertragswerk0,003 USDC
labelled graph square root inventory
POSThttps://datenvertrag.halowerk.com/v1/labelled-graph-square-root-inventory
For a fully captured simple undirected graph G on labelledvertices0..n-1,n0..5, synthesize ALLsimple H onexactlysamelabels suchthat G joins distinctu,v iff their Hshortestpathdistance is1or2. Return ascending fullrootedgemasks,count,canonic
Datenvertragswerk0,003 USDC
latin partial transversal inventory
POSThttps://datenvertrag.halowerk.com/v1/latin-partial-transversal-inventory
For one FULLY CAPTURED labelled LATIN SQUARE oforder1..4, square is itsflatROWMAJORsymbolarray ofexactlyorder*order entries0..order-1; everyrow/column containsallsymbolsexactlyonce. Reconstruct EVERY PARTIAL TRANSVERSAL ofEVERYsize: a subse
Datenvertragswerk0,003 USDC
latin square critical set family
POSThttps://datenvertrag.halowerk.com/v1/latin-square-critical-set-family
For an original complete Latin square of order1..4 with symbols0..n-1, reconstruct ALL cellsubsets which uniquely complete to that original among EVERY labelled Latin square of sameorder and become nonunique after deleting ANY includedcell.
Datenvertragswerk0,003 USDC
latin square isotopy orbit stabilizer
POSThttps://datenvertrag.halowerk.com/v1/latin-square-isotopy-orbit-stabilizer
For a complete Latin square L of order1..4 over labels0..n-1, return EVERY Latin square under independent row/column/symbol permutations and every stabilizing triple. Define action B[i][j]=symbols[L[rows[i]][columns[j]]]: rows and columns a
Datenvertragswerk0,003 USDC
latin square orthogonal mate family
POSThttps://datenvertrag.halowerk.com/v1/latin-square-orthogonal-mate-family
For a fully captured Latin square of order1..4 on labels0..n-1, construct ALL Latin squares B for which every ordered pair (original[r][c],B[r][c]) occurs exactly once. Return every mate as a flat row-major value array in numeric lexicograp
Datenvertragswerk0,003 USDC
line mass transport audit
POSThttps://datenvertrag.halowerk.com/v1/line-mass-transport-audit
For two strictly position-sorted positive-integer mass histograms with1..8bins, coordinates-32..32 and equal totalmass1..32, construct the full canonical monotone quantile coupling matrix. Return raw mass-times-distance L1cost, reduced rati
Datenvertragswerk0,003 USDC
literal like pattern witness
POSThttps://datenvertrag.halowerk.com/v1/literal-like-pattern-witness
Decide whole-string LIKE membership for caller-supplied nonnull text, pattern and explicit escape, returning parsed tokens and a deterministic shortest-percent-span witness. Bounded Unicode scalar codepoint literal equality profile: undersc
Datenvertragswerk0,003 USDC
longest common subsequence family
POSThttps://datenvertrag.halowerk.com/v1/longest-common-subsequence-family
For two supplied binary strings of length0..5, return ALL DISTINCT maximum-length common subsequence WORDS, sorted lexicographically, their length/count, and the lexicographically earliest zero-based index tuple embedding each word in each
Datenvertragswerk0,003 USDC
lz78 phrase dictionary ledger
POSThttps://datenvertrag.halowerk.com/v1/lz78-phrase-dictionary-ledger
For an original word of0..48symbols each0..15, reconstruct every LZ78 phrase boundary, prefix-index/next-symbol pair, dictionary entry and independent decoded word. Dictionary starts at index0 empty; longest existing prefix extends by next
Datenvertragswerk0,003 USDC
merge match action agreement
POSThttps://datenvertrag.halowerk.com/v1/merge-match-action-agreement
Audit whether pre-resolved source actions for the same physical MERGE target row satisfy documented action-agreement conditions,or contain a provable UPDATE/DELETE or unequal-UPDATE conflict,before warehouse loading. Normalized physical tar
Datenvertragswerk0,003 USDC
minimal absent subsequence family
POSThttps://datenvertrag.halowerk.com/v1/minimal-absent-subsequence-family
For an original binary word of length0..7 over the FIXED alphabet{0,1}, construct EVERY minimal absent SUBSEQUENCE: the whole word does not embed with increasing source positions, but every proper subsequence does. Equivalently every single
Datenvertragswerk0,003 USDC
minimal chordal completion inventory
POSThttps://datenvertrag.halowerk.com/v1/minimal-chordal-completion-inventory
From a supplied simple undirected graph on 1..5 labelled vertices synthesize every inclusion-minimal set of missing edges that removes all induced cycles of length at least four. Return the complete sorted numeric fill-mask inventory over l
Datenvertragswerk0,003 USDC
minimal functional dependency cover family
POSThttps://datenvertrag.halowerk.com/v1/minimal-functional-dependency-cover-family
For0..3 attributes labelled0..n-1 and original nontrivial singleton-RHS functional dependencies with nonempty determinants, derive EVERY equivalent minimal single-RHS cover. LHS is an attribute bitmask; RHS is one label. A cover preserves t
Datenvertragswerk0,003 USDC
minimal universal window cycle audit
POSThttps://datenvertrag.halowerk.com/v1/minimal-universal-window-cycle-audit
For numeric alphabet0..k-1 with k1..4 and order1..4, construct the entire lexicographically least de Bruijn cycle containing each order-length word exactly once cyclically. Return full cycle, linearization obtained by cyclically appending o
Datenvertragswerk0,003 USDC
minimum binary covering code family
POSThttps://datenvertrag.halowerk.com/v1/minimum-binary-covering-code-family
Given wordlength n1..4 and radius0..n, synthesize ALL minimum-cardinality subsets C of the entire binary cube0..2^n-1 such that every word is within Hamming distance radius of some center in C. Codes may be nonlinear and need not contain0;
Datenvertragswerk0,003 USDC
minimum degree boolean annihilator family
POSThttps://datenvertrag.halowerk.com/v1/minimum-degree-boolean-annihilator-family
For n1..3 and a complete Boolean truth-table bitmask f, return the common minimum algebraic degree among ALL nonzero squarefree GF2 polynomials g satisfying f*g=0 or(1+f)*g=0 pointwise, and EVERY polynomial at that minimum. Entries sort by
Datenvertragswerk0,003 USDC
minimum edge clique partition family
POSThttps://datenvertrag.halowerk.com/v1/minimum-edge-clique-partition-family
For a fully captured simple undirected graph on 0..4 labelled vertices, construct EVERY minimum-cardinality partition of its EDGE set into cliques, each edge used exactly once. Cliques contain at least two vertices; isolated vertices requir
Datenvertragswerk0,003 USDC
minimum equivalent digraph family
POSThttps://datenvertrag.halowerk.com/v1/minimum-equivalent-digraph-family
For an original simpleloopless labelled digraph on0..4vertices, return EVERYminimum-CARDINALITY edge SUBSET preserving all original reachability. Cycles/disconnectedgraphs areaccepted. No newedge may beintroduced. Return canonical originale
Datenvertragswerk0,003 USDC
minimum feedback vertex set family
POSThttps://datenvertrag.halowerk.com/v1/minimum-feedback-vertex-set-family
For one FULLY CAPTURED labelled simple undirected graph n0..5 on0..n-1, reconstruct EVERY MINIMUM-CARDINALITY FEEDBACK VERTEX SET: remove selectedvertices and ALLincidentedges so that the ORIGINAL INDUCED graph onretainedvertices is a FORES
Datenvertragswerk0,003 USDC
minimum final observation suite family
POSThttps://datenvertrag.halowerk.com/v1/minimum-final-observation-suite-family
Given two permutation actions on n1..4 original states0..n-1 and binary Mooreoutputs, use the FIXED ordered wordcatalog [empty,0,1,00,01,10,11], indexed0..6. Each testword starts independently at the same hypothetical originalstate and obse
Datenvertragswerk0,003 USDC
minimum palindromic factorization audit
POSThttps://datenvertrag.halowerk.com/v1/minimum-palindromic-factorization-audit
Own bounded palindromechart/dynamicprogramming for <=64numeric tokens0..15. Return global minimumnumberofnonempty palindromicpieces, exact countofalloptimalcutpatterns, lexleastendpositions, wholechosenchunks and everyprefixoptimum/count. N
Datenvertragswerk0,003 USDC
minimum poset chain partition family
POSThttps://datenvertrag.halowerk.com/v1/minimum-poset-chain-partition-family
For one FULLY CAPTURED original labelled DAG n0..4 on0..n-1, reconstruct EVERY MINIMUM-CARDINALITY PARTITION of its vertices into disjoint CHAINS of the transitive precedence order. edge_mask bitk encodes orderedpair(u,v),u!=v,in increasing
Datenvertragswerk0,003 USDC
minimum poset realizer family
POSThttps://datenvertrag.halowerk.com/v1/minimum-poset-realizer-family
For an original precedence DAG on1..4fixedlabels0..n-1, take its strict transitive closure and construct ALL minimum-cardinality realizers: sets of distinct whole linear extensions whose intersection is exactly that partial order. Return ca
Datenvertragswerk0,003 USDC
minimum sorting network family
POSThttps://datenvertrag.halowerk.com/v1/minimum-sorting-network-family
For a supplied wire count n0..4, synthesize EVERY minimum-COMPARATOR fixed sorting network. A comparator(i,j),i<j, sends min to lower-index wire and max to higher-index wire; the same entire sequence must sort EVERY input, not one permutati
Datenvertragswerk0,003 USDC
monotone elias fano layout audit
POSThttps://datenvertrag.halowerk.com/v1/monotone-elias-fano-layout-audit
Construct and audit the whole Elias-Fano bit layout of an original nondecreasing0..64item integer sequence0..65535. U=max+1 for nonempty and0 for empty; lowwidth=max(0,floor(log2(U/n))) else0. Own explicit convention: low blocksLSB-first; u