The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Additivity of the genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for monotone planar circuit value and variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank

Latest revision as of 13:01, 12 July 2024

scientific article
Language Label Description Also known as
English
The Monotone Circuit Value Problem with Bounded Genus Is in NC
scientific article

    Statements

    Identifiers