scholarly journals NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems

2020 ◽  
Author(s):  
Changyong Hu ◽  
Vijay K. Garg
Keyword(s):  
Nc Algorithms

Parallel algorithms for matroid intersection and matroid parity

2015 ◽  
Vol 07 (02) ◽  
pp. 1550019
Author(s):  
Jinyu Huang
Keyword(s):  
Parallel Algorithms ◽  
Polynomial Identity ◽  
Black Box ◽  
Matroid Intersection ◽  
Polynomial Identity Testing ◽  
Identity Testing ◽  
Common Base ◽  
Graphic Matroid ◽  
Matroid Parity ◽  
Nc Algorithms

A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity) is in NC2, provided that there are polynomial number of common bases (basic matroid parity sets). For graphic matroids, we show that finding a common base for matroid intersection is in NC2, if the number of common bases is polynomial bounded. To our knowledge, these algorithms are the first deterministic NC algorithms for matroid intersection and matroid parity. We also give a new RNC2 algorithm that finds a common base for graphic matroid intersection. We prove that if there is a black-box NC algorithm for Polynomial Identity Testing (PIT), then there is an NC algorithm to determine the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity).

NC-ALGORITHMS FOR OPERATIONS ON BINARY DECISION DIAGRAMS

1993 ◽  
Vol 03 (01) ◽  
pp. 3-12 ◽  
Author(s):  
DETLEF SIELING ◽  
INGO WEGENER
Keyword(s):  
Binary Decision Diagrams ◽  
Pattern Generation ◽  
Decision Diagrams ◽  
Equivalence Test ◽  
Ordered Binary Decision Diagrams ◽  
Binary Decision ◽  
Verification Test ◽  
Logical Synthesis ◽  
Redundancy Test ◽  
Nc Algorithms

(Ordered) binary decision diagrams are a powerful representation for Boolean functions and are widely used in logical synthesis, verification, test pattern generation or as part of CAD tools. NC-algorithms are presented for the most important operations on this representation, e.g. evaluation for a given input, minimization, satisfiability, redundancy test, replacement of variables by constants or functions, equivalence test and synthesis. The algorithms have logarithmic run time on CRCW COMMON PRAMs with a polynomial number of processors.

On NC algorithms for problems on bounded rank-width graphs

2018 ◽  
Vol 139 ◽  
pp. 64-67
Author(s):  
Bireswar Das ◽  
Anirban Dasgupta ◽  
Murali Krishna Enduri ◽  
I. Vinod Reddy
Keyword(s):  
Bounded Rank ◽  
Nc Algorithms

NC algorithms for the single most vital edge problem with respect to shortest paths

1996 ◽  
Vol 60 (5) ◽  
pp. 243-248 ◽  
Author(s):  
Sven Venema ◽  
Hong Shen ◽  
Francis Suraweera
Keyword(s):  
Shortest Paths ◽  
Edge Problem ◽  
Nc Algorithms

scholarly journals NC algorithms for real algebraic numbers

1992 ◽  
Vol 3 (2) ◽  
pp. 79-98 ◽  
Author(s):  
F. Cucker ◽  
H. Lanneau ◽  
B. Mishra ◽  
P. Pedersen ◽  
M. -F. Roy
Keyword(s):  
Algebraic Numbers ◽  
Nc Algorithms
Sign in / Sign up

Export Citation Format

Share Document