Matches in SemOpenAlex for { <https://semopenalex.org/work/W4291143792> ?p ?o ?g. }
Showing items 1 to 74 of
74
with 100 items per page.
- W4291143792 abstract "In 1990 Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem (CCV). He and Mayr showed that NL subseteq CC subseteq P, and proved that in addition to CCV several other problems are complete for CC, including the stable marriage problem, and finding the lexicographically first maximal matching in a bipartite graph. We are interested in CC because we conjecture that it is incomparable with the parallel class NC which also satisfies NL subseteq NC subseteq P, and note that this conjecture implies that none of the CC-complete problems has an efficient polylog time parallel algorithm. We provide evidence for our conjecture by giving oracle settings in which relativized CC and relativized NC are incomparable. We give several alternative definitions of CC, including (among others) the class of problems computed by uniform polynomial-size families of comparator circuits supplied with copies of the input and its negation, the class of problems AC^0-reducible to CCV, and the class of problems computed by uniform AC^0 circuits with CCV gates. We also give a machine model for CC, which corresponds to its characterization as log-space uniform polynomial-size families of comparator circuits. These various characterizations show that CC is a robust class. The main technical tool we employ is universal comparator circuits. Other results include a simpler proof of NL subseteq CC, and an explanation of the relation between the Gale-Shapley algorithm and Subramanian's algorithm for stable marriage. This paper continues the previous work of Cook, L^e and Ye which focused on Cook-Nguyen style uniform proof complexity, answering several open questions raised in that paper." @default.
- W4291143792 created "2022-08-13" @default.
- W4291143792 creator A5013798760 @default.
- W4291143792 creator A5034555443 @default.
- W4291143792 creator A5047362769 @default.
- W4291143792 date "2012-08-13" @default.
- W4291143792 modified "2023-10-18" @default.
- W4291143792 title "The Complexity of the Comparator Circuit Value Problem" @default.
- W4291143792 doi "https://doi.org/10.48550/arxiv.1208.2721" @default.
- W4291143792 hasPublicationYear "2012" @default.
- W4291143792 type Work @default.
- W4291143792 citedByCount "0" @default.
- W4291143792 crossrefType "posted-content" @default.
- W4291143792 hasAuthorship W4291143792A5013798760 @default.
- W4291143792 hasAuthorship W4291143792A5034555443 @default.
- W4291143792 hasAuthorship W4291143792A5047362769 @default.
- W4291143792 hasBestOaLocation W42911437921 @default.
- W4291143792 hasConcept C111919701 @default.
- W4291143792 hasConcept C114614502 @default.
- W4291143792 hasConcept C115903868 @default.
- W4291143792 hasConcept C118615104 @default.
- W4291143792 hasConcept C121332964 @default.
- W4291143792 hasConcept C132525143 @default.
- W4291143792 hasConcept C134026603 @default.
- W4291143792 hasConcept C154945302 @default.
- W4291143792 hasConcept C155745195 @default.
- W4291143792 hasConcept C165801399 @default.
- W4291143792 hasConcept C197657726 @default.
- W4291143792 hasConcept C2777212361 @default.
- W4291143792 hasConcept C2778572836 @default.
- W4291143792 hasConcept C2780990831 @default.
- W4291143792 hasConcept C311688 @default.
- W4291143792 hasConcept C33923547 @default.
- W4291143792 hasConcept C39637292 @default.
- W4291143792 hasConcept C41008148 @default.
- W4291143792 hasConcept C55166926 @default.
- W4291143792 hasConcept C62520636 @default.
- W4291143792 hasConceptScore W4291143792C111919701 @default.
- W4291143792 hasConceptScore W4291143792C114614502 @default.
- W4291143792 hasConceptScore W4291143792C115903868 @default.
- W4291143792 hasConceptScore W4291143792C118615104 @default.
- W4291143792 hasConceptScore W4291143792C121332964 @default.
- W4291143792 hasConceptScore W4291143792C132525143 @default.
- W4291143792 hasConceptScore W4291143792C134026603 @default.
- W4291143792 hasConceptScore W4291143792C154945302 @default.
- W4291143792 hasConceptScore W4291143792C155745195 @default.
- W4291143792 hasConceptScore W4291143792C165801399 @default.
- W4291143792 hasConceptScore W4291143792C197657726 @default.
- W4291143792 hasConceptScore W4291143792C2777212361 @default.
- W4291143792 hasConceptScore W4291143792C2778572836 @default.
- W4291143792 hasConceptScore W4291143792C2780990831 @default.
- W4291143792 hasConceptScore W4291143792C311688 @default.
- W4291143792 hasConceptScore W4291143792C33923547 @default.
- W4291143792 hasConceptScore W4291143792C39637292 @default.
- W4291143792 hasConceptScore W4291143792C41008148 @default.
- W4291143792 hasConceptScore W4291143792C55166926 @default.
- W4291143792 hasConceptScore W4291143792C62520636 @default.
- W4291143792 hasLocation W42911437921 @default.
- W4291143792 hasLocation W42911437922 @default.
- W4291143792 hasOpenAccess W4291143792 @default.
- W4291143792 hasPrimaryLocation W42911437921 @default.
- W4291143792 hasRelatedWork W107440705 @default.
- W4291143792 hasRelatedWork W1980093022 @default.
- W4291143792 hasRelatedWork W2004006145 @default.
- W4291143792 hasRelatedWork W2016263640 @default.
- W4291143792 hasRelatedWork W2059126233 @default.
- W4291143792 hasRelatedWork W2085815746 @default.
- W4291143792 hasRelatedWork W2527394287 @default.
- W4291143792 hasRelatedWork W2770134917 @default.
- W4291143792 hasRelatedWork W2949460568 @default.
- W4291143792 hasRelatedWork W3123287700 @default.
- W4291143792 isParatext "false" @default.
- W4291143792 isRetracted "false" @default.
- W4291143792 workType "article" @default.