THE THOMPSON–HIGMAN MONOIDS M<sub>k,i</sub>: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY (Q2996837): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q766115
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jean-Camille Birget / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0904.2479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M<sub>k, 1</sub> AND THEIR COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monoid generalizations of the Richard Thompson groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way permutations, computational asymmetry and distortion. / rank
 
Normal rank
Property / cites work
 
Property / cites work: FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of parity polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtractive reductions and complete problems for counting complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of parallel computers from various basis of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction which can be used to produce finitely presented infinite simple groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998976 / rank
 
Normal rank

Revision as of 01:00, 4 July 2024

scientific article
Language Label Description Also known as
English
THE THOMPSON–HIGMAN MONOIDS M<sub>k,i</sub>: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY
scientific article

    Statements

    THE THOMPSON–HIGMAN MONOIDS M<sub>k,i</sub>: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY (English)
    0 references
    3 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Thompson-Higman monoids
    0 references
    Thompson-Higman groups
    0 references
    inverse monoids
    0 references
    Green relations
    0 references
    computational complexity
    0 references
    decision problems
    0 references
    maximal subgroups
    0 references
    0 references