A lower bound for randomized algebraic decision trees (Q1386178): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized semi-algebraic test complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound on testing membership to a polyhedron by algebraic decision and computation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5621733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point location in arrangements of hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for solving linear diophantine equations on random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating probabilistic by deterministic algebraic computation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of problems on probabilistic, nondeterministic, and alternating decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on probabilistic linear decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for algebraic decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision tree complexity and Betti numbers / rank
 
Normal rank

Latest revision as of 11:33, 28 May 2024

scientific article
Language Label Description Also known as
English
A lower bound for randomized algebraic decision trees
scientific article

    Statements

    A lower bound for randomized algebraic decision trees (English)
    0 references
    0 references
    0 references
    0 references
    13 May 1998
    0 references
    randomized algebraic decision trees
    0 references
    knapsack problem
    0 references
    element distinctness problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references