Results 31 to 40 of about 93,203 (297)
On the (Non) NP-Hardness of Computing Circuit Complexity [PDF]
, 2015 The Minimum Circuit Size Problem (MCSP) is: given the truth table of a Boolean function f and a size parameter k, is the circuit complexity of f at most k?
Williams, R. Ryan, Murray, Cody D.
core +1 more source
Linear growth of circuit complexity from Brownian dynamics
Journal of High Energy Physics, 2023 How rapidly can a many-body quantum system generate randomness? Using path integral methods, we demonstrate that Brownian quantum systems have circuit complexity that grows linearly with time.
Shao-Kai Jian +2 more
doaj +1 more source
Circuit complexity for Carrollian Conformal (BMS) field theories
Journal of High Energy Physics, 2023 We systematically explore the construction of Nielsen’s circuit complexity to a non-Lorentzian field theory keeping in mind its connection with flat holography.
Arpan Bhattacharyya, Poulami Nandi
doaj +1 more source
Proof complexity lower bounds from algebraic circuit complexity [PDF]
, 2016 We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi~\cite{GrochowPitassi14}, where the circuits comprising the proof come from various restricted ...
Wigderson, Avi +4 more
core +1 more source
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms
, 2022 We study the amortized circuit complexity of boolean functions. Given a circuit model F and a boolean function f : {0,1}n → {0,1}, the F-amortized circuit complexity is defined to be the size of the smallest circuit that outputs m copies of f (evaluated ...
Zuiddam, J.; id_orcid +3 more
core +1 more source
Frontiers in Computational Neuroscience, 2018 A dynamic system showing stable rhythmic activity can be represented by the dynamics of phase oscillators. This would provide a useful mathematical framework through which one can understand the system's dynamic properties.
Kento Suzuki +3 more
doaj +1 more source
Exponential lower bounds and separation for query rewriting [PDF]
, 2012 We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies.
S. Kikot +11 more
core +1 more source
Linear growth of quantum circuit complexity
, 2021 Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits' complexity increases. Consider
Faist, Philippe +5 more
core +3 more sources
Complexity of warped conformal field theory
European Physical Journal C: Particles and Fields, 2023 Warped conformal field theories in two dimensions are exotic nonlocal, Lorentz violating field theories characterized by Virasoro–Kac–Moody symmetries and have attracted a lot of attention as candidate boundary duals to warped AdS $$_3$$ 3 spacetimes ...
Arpan Bhattacharyya +2 more
doaj +1 more source
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing, 2010 In this paper, we are concerned with the exponential complexity of the Circuit Satisfiability (CktSat) problem and more generally with the exponential complexity of NP-complete problems. Over the past 15 years or so, researchers have obtained a number of exponential-time algorithms with improved running times for exactly solving a variety of NP ...
Paturi, R., Pudlák, P. (Pavel)
openaire +2 more sources