We study the polynomial-time autoreducibility of NP-complete sets and obtain separations under strong hypotheses for NP. Assuming there is a p-generic set in NP, we show the follo...
In this paper we initiate the study of width in semi-algebraic proof systems and various cut-based procedures in integer programming. We focus on two important systems: Gomory-Chv...
The seminal result that every language having an interactive proof also has a zero-knowledge interactive proof assumes the existence of one-way functions. Ostrovsky and Wigderson ...
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, ...
We give improved hitting-sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known variable order. The best...
Extended Clifford circuits, such as those in [1], straddle the boundary between classical and quantum computational power. Whether such circuits are efficiently classically simula...
This paper presents a control scheme which uses a combination of linear Model Predictive Control (MPC) and a Constraint Satisfaction Problem (CSP) to solve the non-linear operatio...
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat...
We present an experimental study of the price-setting newsvendor problem, which extends the traditional framework by allowing the decision maker to determine both the selling pric...
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property th...
Jacobus H. Koolen, Woo-Sun Lee, William J. Martin,...
A set partition σ of [n] = {1, . . . , n} contains another set partition π if restricting σ to some S ⊆ [n] and then standardizing the result gives π. Otherwise we say σ av...
Samantha Dahlberg, Robert Dorward, Jonathan Gerhar...