Results 11 to 20 of about 1,805,692 (290)
Space Complexity in Polynomial Calculus [PDF]
SIAM Journal on Computing, 2012 Summary: During the last 10 to 15 years, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs. Besides being a natural complexity measure of intrinsic interest, space is also an important concern in SAT solving, and so research has mostly focused on weak systems that are used by SAT ...
Yuval Filmus +4 more
core +16 more sources
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width [PDF]
, 1998 It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, S D
core +7 more sources
On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems. [PDF]
Entropy (Basel), 2021 This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the ...
Prusińska A, Szkatuła K, Tret'yakov A.
europepmc +2 more sources
Institutional complexity is complexity with an adjective
, 2021 A review of the studies on institutional complexity reveals that the many definitions of institutional complexity and related concepts share similarities with the understanding of complexity and complex systems of complexity science. Yet few publications
Papin, Marielle
core +1 more source
Governing Complexity in World Politics
, 2021 Complexity is the new global ontology for world politics. This article summarizes the characteristics of complexity and its implications for informed US state policy making.
Western, Jon, Haas, Peter M
core +1 more source
On the Complexity of Symmetric Polynomials.
ITCS, 2018 Peer ...
Markus Bläser, Gorav Jindal
openaire +6 more sources
On the Nash equilibrium in the inspector problem
Lietuvos Matematikos Rinkinys, 2014 Inspector problem represents an economic duel of inspector and law violator and is formulated as a bimatrix game. In general, bimatrix game is NP-complete problem.
Martynas Sabaliauskas, Jonas Mockus
doaj +1 more source
Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2002 A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem.
Lešaja Goran
doaj +1 more source
IEEE Access, 2022 Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography.
Jiang Ma +3 more
doaj +1 more source
Logical Methods in Computer Science, 2020 The complexity of parity games is a long standing open problem that saw a major breakthrough in 2017 when two quasi-polynomial algorithms were published. This article presents a third, independent approach to solving parity games in quasi-polynomial time,
Karoliina Lehtinen, Udi Boker
doaj +1 more source