Time-space tradeoffs for counting NP solutions modulo integers (Q937201)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Time-space tradeoffs for counting NP solutions modulo integers |
scientific article; zbMATH DE number 5314392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space tradeoffs for counting NP solutions modulo integers |
scientific article; zbMATH DE number 5314392 |
Statements
Time-space tradeoffs for counting NP solutions modulo integers (English)
0 references
20 August 2008
0 references
Time-space tradeoffs
0 references
lower bounds
0 references
modular counting
0 references
satisfiability
0 references
reversible computation
0 references
diagonalization
0 references
0.8094823956489563
0 references
0.809132993221283
0 references
0.7414211630821228
0 references
0.7414211630821228
0 references
