Back to Results
First PageMeta Content
Circuit complexity / Computational complexity theory / ACC0 / FO / Comparator / Sorting network / AC / TC0 / Boolean circuit / Theoretical computer science / Applied mathematics / Complexity classes


A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm
Add to Reading List

Document Date: 2014-04-02 14:14:13

Open Document

File Size: 460,43 KB

Share Result on Facebook

City

Princeton / New York / /

Company

ACM Inc. / Oracle / /

Country

Canada / United States / /

Currency

USD / /

/

Facility

University of Toronto DAI TRI MAN LÊ / University of Toronto YUVAL FILMUS / Penn Plaza / University of Toronto / University of Toronto In / /

/

IndustryTerm

latter algorithm / main technical tool / polylog time parallel algorithm / fixed-point algorithm / parallel algorithms / greedy algorithms / depth-first search / greedy algorithm / telephone connection problem / search problem / computing / intermediate interval algorithm / search problems / described as©a search problem / /

Organization

University of Toronto DAI TRI MAN LÊ / University of Toronto In / School of Mathematics / University of Toronto / Toronto / Federal Communications Commission / University of Toronto YUVAL FILMUS / Department of Computer Science / US Federal Reserve / Institute for Advanced Study / Natural Sciences and Engineering Research Council of Canada / /

Person

Yuli Ye / Dai Tri Man Lê / Yuval Filmus / Stephen A. Cook / Ashok Subramanian / /

/

Position

Author / advisor / Complexity Hierarchies General / left end / /

ProgrammingLanguage

C / /

ProvinceOrState

New Jersey / South Carolina / North Carolina / Ontario / New York / /

Technology

latter algorithm / intermediate interval algorithm / greedy algorithm / polylog time parallel algorithm / fixed-point algorithm / Shapley algorithm / /

URL

http /

SocialTag