Search
Selected: T

The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Mixing Time of Glauber Dynamics for Colouring Regular Trees

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The model checking problem for intuitionistic propositional logic with one variable is AC1-complete

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Multivariate Resultant is NP-hard in any Characteristic

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The One-Way Communication Complexity of Group Membership

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The P versus NP Brief

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The P versus NP Problem

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Partition Bound for Classical Communication Complexity and Query Complexity

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Pattern Matrix Method (Journal Version)

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Phase Transition in Exact Cover

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Power of Depth 2 Circuits over Algebras

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Power of Linear Programming for Valued CSPs

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Power of Nondeterminism in Self-Assembly

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The program complexity on Universal Turing Machines, and a proposal to find efficient n-bounded algorithms of NPC problems by machine enumeration

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Quantum Query Complexity of AC0

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Quantum Separability Problem for Gaussian States

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The rapid points of a complex oscillation

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Recognition of Tolerance and Bounded Tolerance Graphs

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

The Remote Point Problem, Small Bias Space, and Expanding Generator Sets

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.