Border basis detection is NP-complete

Bounded Independence Fools Degree-2 Threshold Functions

Bounded Independence Fools Halfspaces

Bounded Pushdown dimension vs Lempel Ziv information density

Bounding the Sensitivity of Polynomial Threshold Functions

Bounds for Bilinear Complexity of Noncommutative Group Algebras

Bounds for Small-Error and Zero-Error Quantum Algorithms

Bounds on monotone switching networks for directed connectivity

Bounds on the Size of Small Depth Circuits for Approximating Majority

BPP is in NP and coNP

Branching proofs of infeasibility in low density subset sum problems

Breaking One-Round Key-Agreement Protocols in the Random Oracle Model

Bucklin Voting is Broadly Resistant to Control

Calculation of the minimum computational complexity based on information entropy

Can Random Coin Flips Speed Up a Computer?

Can rare SAT formulas be easily recognized? On the efficiency of message passing algorithms for K-SAT at large clause-to-variable ratios

Cell-Probe Lower Bounds for Prefix Sums

Cellular automata and communication complexity

Characterization Of any Non-linear Boolean function Using A Set of Linear Operators

Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra