Abstract
We develop a method for nontrivially restricting fanout in a circuit. We study the complexity of the circuit value problem and a new problem, network stability, when fanout is limited. This leads to new classes of problems within P . We conjecture that the new classes are different from P and incomparable to NC . One of these classes, CC . contains several natural complete problems, including circuit value for comparator circuits, lex-first maximal matching, and problems related to stable marriage and stable roommates. When fanout is appropriately limited, we obtain positive results: a parallel algorithm for circuit value that runs in time about the square root of the number of gates, a linear-time sequential algorithm for network stability, and logspace reductions between circuit value and network stability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
