Complete divisibility problems for slowly utilized oracles (Q1083192)
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: Complete divisibility problems for slowly utilized oracles |
scientific article; zbMATH DE number 3976330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete divisibility problems for slowly utilized oracles |
scientific article; zbMATH DE number 3976330 |
Statements
Complete divisibility problems for slowly utilized oracles (English)
0 references
1985
0 references
The concept of NP-completeness relative to a slowly utilized oracle is introduced and shown to be useful for providing evidence of intractability of some problems that are not known to be NP-complete. One such problem is to decide if a sparse polynomial has a root in the integers (mod p) for prime p. Relationships between unrelativized complexity and complexity relative to a slowly utilized oracle are also given.
0 references
polynomial divisibility
0 references
NP-completeness relative to a slowly utilized oracle
0 references
intractability
0 references
sparse polynomial
0 references
root
0 references
unrelativized complexity
0 references
complexity relative to a slowly utilized oracle
0 references
0 references
0.86492044
0 references
0.8574164
0 references
0 references
0.84309596
0 references
0.84268725
0 references
0.8401928
0 references
0 references
0.8372848
0 references
0 references
