Algorithms for circuits and circuits for algorithms: connecting the tractable and intractable (Q4589023)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6803218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for circuits and circuits for algorithms: connecting the tractable and intractable |
scientific article; zbMATH DE number 6803218 |
Statements
6 November 2017
0 references
circuit complexity
0 references
algorithm analysis
0 references
satisfiability
0 references
lower bounds
0 references
derandomization
0 references
learning
0 references
exact algorithms
0 references
parameterized algorithms
0 references
0.7476540207862854
0 references
0.7327392101287842
0 references
0.7106155157089233
0 references
0.7087802290916443
0 references
