OpenAlex
On the complexity of circuit satisfiability
Work
Year: 2010
Type: article
Authors Ramamohan Paturi, Pavel Pudlák
Institutions University of California, San Diego, Czech Academy of Sciences
Cites: 42
Cited by: 16
Related to: 10
FWCI: 3.429
Citation percentile (by year/subfield): 84.37
Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed