Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms (Q314185): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2016-0009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2343786357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean functions in the class of canonical polarized polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean functions in the class of polarized polynomial forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of representation of multiple-valued logic functions as polarised polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polarised polynomials of multi-valued logic functions in one variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for complexity of polynomial normal forms of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of generalized polynomials of \(k\)-valued functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3268312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5150521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stationary classes of three-value logic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5264747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ESTIMATIONS OF UNRELIABILITY OF CIRCUITS IN ROSSER — TURKETT BASIS (IN P3) WITH FAULTS OF TYPE 0 AT THE OUTPUTS OF GATES / rank
 
Normal rank

Latest revision as of 13:28, 12 July 2024

scientific article
Language Label Description Also known as
English
Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
scientific article

    Statements

    Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms (English)
    0 references
    13 September 2016
    0 references
    Boolean function
    0 references
    function of three-valued logic
    0 references
    function of \(k\)-valued logic
    0 references
    polarized polynomial form (PPF)
    0 references
    complexity
    0 references
    upper estimate
    0 references
    lower estimate
    0 references

    Identifiers