Search
Selected: B

Backdoors to Tractable Answer-Set Programming

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Baire Categories on Small Complexity Classes and Meager-Comeager Laws

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Balancing Bounded Treewidth Circuits

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Barbosa, Uniform Polynomial Time Bounds, and Promises

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Barriers and local minima in energy landscapes of stochastic local search

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Basic properties for sand automata

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Better Gap-Hamming Lower Bounds via Better Round Elimination

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Beyond Hypertree Width: Decomposition Methods Without Decompositions

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Beyond Language Equivalence on Visibly Pushdown Automata

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bicriteria Network Design Problems

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Binary Matroids and Quantum Probability Distributions

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Block Sensitivity of Minterm-Transitive Functions

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Boolean Operations, Joins, and the Extended Low Hierarchy

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Boolean Satisfiability using Noise Based Logic

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Border basis detection is NP-complete

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounded Independence Fools Degree-2 Threshold Functions

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounded Independence Fools Halfspaces

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.