A new sibling of BQP
A New Structural Property of SAT
A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning
A Non-Triviality Certificate for Scalars and its application to Linear Systems
A note about a partial no-go theorem for quantum PCP
A Note on Bulk Quantum Turing Machine
A note on dimensions of polynomial size circuits
A Note on Mathematical Modelling of Practical Multicampaign Assignment and Its Computational Complexity
A Note on Nonuniform versus Uniform ACC^k Circuits for NE
A Note on the Balanced ST-Connectivity
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs
A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas
A note on the sign degree of formulas
A Note on Tiling under Tomographic Constraints
A Novel Hybrid Algorithm for Task Graph Scheduling
A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy
A Parallel Approximation Algorithm for Positive Semidefinite Programming
A Particular Universal Cellular Automaton
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
A PCP Characterization of AM