Search
Selected: O

On Exponential Time Lower Bound of Knapsack under Backtracking

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Gröbner Basis Detection for Zero-dimensional Ideals

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Invariance and Convergence in Time Complexity theory

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On local equilibrium equations for clustering states

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Lower Bounds for Constant Width Arithmetic Circuits

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On models of a nondeterministic computation

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On NFAs Where All States are Final, Initial, or Both

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On optimal heuristic randomized semidecision procedures, with application to proof complexity

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Optimality Condition of Complex Systems: Computational Evidence

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Polynomial Multiplication in Chebyshev Basis

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Polynomial Time Computable Numbers

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Quadratic Programming with a Ratio Objective

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On quantum and classical space-bounded processes with algebraic transition amplitudes

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On quantum interactive proofs with short messages

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On Quantum-Classical Equivalence for Composed Communication Problems

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.