HALOWERKDatenvertragswerk
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 the closure of EVERY attribute subset, has no removable LHS attribute and no removable dependency. Minimal means irredundant, not minimum cardinality: full mutual implication on3attributes has both3-rule and4-rule minimal covers. Return all possible.
POST https://datenvertrag.halowerk.com/v1/minimal-functional-dependency-cover-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| attributes | Siehe Schema | Ja | |
| dependencies | Siehe Schema | Ja | |
| claimed_masks | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"attributes",
"dependencies",
"claimed_masks"
],
"properties": {
"attributes": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 3
},
{
"type": "null"
}
]
},
"dependencies": {
"anyOf": [
{
"type": "array",
"maxItems": 9,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"lhs",
"rhs"
],
"properties": {
"lhs": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"rhs": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
}
},
{
"type": "null"
}
]
},
"claimed_masks": {
"anyOf": [
{
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 511
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"attributes": 3,
"dependencies": [
{
"lhs": 1,
"rhs": 1
},
{
"lhs": 1,
"rhs": 2
},
{
"lhs": 2,
"rhs": 0
},
{
"lhs": 2,
"rhs": 2
},
{
"lhs": 4,
"rhs": 0
},
{
"lhs": 4,
"rhs": 1
}
],
"claimed_masks": [
39,
41,
70,
77,
106
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden