On the public citation graph

Finite binary relations have no more complexity than finite functions

https://doi.org/10.1007/bf02315969
0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02572298openalex-snapshot
A generalization of the rees theorem to a class of regular semigroups
inferredcites →https://doi.org/10.1007/bf02572873openalex-snapshot
The Schützenberger group of anH-class in the semigroup of binary relations
inferredcites →https://doi.org/10.1007/bf02572879openalex-snapshot
Research Problems
inferredcites →https://doi.org/10.1007/bf02572880openalex-snapshot
Idempotents and product representations with applications to the semigroup of binary relations
inferredcites →https://doi.org/10.1007/bf02572945openalex-snapshot
On (0,1)-matrix semigroups
inferredcites →https://doi.org/10.1007/bf02572960openalex-snapshot
Homomorphisms of semigroups of binary relations
inferredcites →https://doi.org/10.1007/bf02572961openalex-snapshot
Decomposition and complexity of finite semigroups
inferredcites →https://doi.org/10.1007/bf02573046openalex-snapshot
Groups of binary relations
inferredcites →https://doi.org/10.1007/bf02573047openalex-snapshot
A proof of the montague-plemmons-schein theorem on maximal subgroups of the semigroup of binary relations
inferredcites →https://doi.org/10.1016/0001-8708(73)90007-8openalex-snapshot
Chapter 1. Extension of the fundamental theorem of finite semigroups
inferredcites →https://doi.org/10.1016/0021-8693(66)90035-4openalex-snapshot
Some results on finite semigroups
inferredcites →https://doi.org/10.1016/0021-8693(69)90119-7openalex-snapshot
Maximal subgroups of the semigroup of relations
inferredcites →https://doi.org/10.1016/0022-4049(71)90012-0openalex-snapshot
Lower bounds for complexity of finite semigroups
inferredcites →https://doi.org/10.1016/0095-8956(72)90064-0openalex-snapshot
The number of partially ordered sets
inferredcites →https://doi.org/10.1016/0097-3165(71)90064-1openalex-snapshot
Proof of the Fundamental Lemma of Complexity (weak version) for arbitrary finite semigroups
inferredcites →https://doi.org/10.1090/s0002-9904-1968-12064-6openalex-snapshot
The fundamental lemma of complexity for arbitrary finite semigroups
inferredcites →https://doi.org/10.2140/pjm.1970.35.743openalex-snapshot
On the semigroup of binary relations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf02572554openalex-snapshot
Idempotent boolean matrices
inferred← citeshttps://doi.org/10.1007/bf02574269openalex-snapshot
Another semigroup of complexity n-1
inferred← citeshttps://doi.org/10.1016/0024-3795(79)90024-7openalex-snapshot
The group-theoretic complexity of subsemigroups of boolean matrices
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2011.02.048openalex-snapshot
Representation theory of finite semigroups over semirings
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)60384-0openalex-snapshot
Chapter XII Complexity of Semigroups and Morphisms
inferred← citeshttps://doi.org/10.1023/a:1015880225781openalex-snapshot
Complete Semigroups of Binary Relations Defined by Elementary and Nodal X-Semilattices of Unions
inferred← citeshttps://doi.org/10.1023/a:1025030132270openalex-snapshot
Complete Semigroups of Binary Relations
inferred← citeshttps://doi.org/10.1080/00029890.1976.11994114openalex-snapshot
Some Applications of the Wreath Product Construction
inferred← citeshttps://doi.org/10.1142/s0218196704002067openalex-snapshot
INTRODUCTION
inferred← citeshttps://doi.org/10.4171/pm/1921openalex-snapshot
Krohn–Rhodes complexity of Brauer type semigroups
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.