Výsledky vyhledávání - Abstract computational complexity for mathematik programming problems*

Sparse Integer Programming Is Fixed-Parameter Tractable.

Autoři: Eisenbrand, Friedrich Hunkenschröder, Christoph Klein, Kim-Manuel a další

Zdroj: Mathematics of Operations Research; Aug2025, Vol. 50 Issue 3, p2141-2156, 16p

Témata: INTEGER programming, COMPUTATIONAL complexity, POLYNOMIAL time algorithms, CONVEX functions, INTEGERS, ALGORITHMS

SAT requires exhaustive search.

Autoři: Xu, Ke Zhou, Guangyan

Zdroj: Frontiers of Computer Science; Dec2025, Vol. 19 Issue 12, p1-14, 14p

Multilevel quadrature formulae for the optimal control of random PDEs.

Autoři: Nobile, Fabio Vanzan, Tommaso

Zdroj: Numerische Mathematik; Dec2025, Vol. 157 Issue 6, p2291-2322, 32p

Témata: OPTIMAL control theory, MONTE Carlo method, STOCHASTIC partial differential equations, NUMERICAL integration, ASYMPTOTIC analysis, LAGRANGE multiplier, NUMERICAL analysis, COMPUTATIONAL complexity

Complexity Theory.

Zdroj: Oberwolfach Reports; 2024, Vol. 21 Issue 2, p1517-1562, 46p

Témata: COMPUTATIONAL complexity, CODING theory, COMBINATORICS, COMPLEXITY (Philosophy), ARITHMETIC

SMALL TERM REACHABILITY AND RELATED PROBLEMS FOR TERMINATING TERM REWRITING SYSTEMS.

Autoři: BAADER, FRANZ GIESL, JURGEN

Zdroj: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p8:1-8:31, 1p

Témata: COMPUTATIONAL complexity, MATHEMATICAL logic

Note on combinatorial optimization with max-linear objective functions

Autoři: Francesco Maffioli Sung-Jin Chung Katta G. Murty a další

Přispěvatelé: Francesco Maffioli Sung-Jin Chung Katta G. Murty a další

Zdroj: Discrete Applied Mathematics. 42:139-145

Témata: Combinatorial optimization, max-linear combinatorial problem, Science, Applied Mathematics, strongly NP-hard, 0211 other engineering and technologies, 02 engineering and technology, lower bounds, multicriteria optimization, 0202 electrical engineering, electronic engineering, information engineering, branch-and-bound, Discrete Mathematics and Combinatorics, Abstract computational complexity for mathematical programming problems, Mathematics

Popis souboru: application/xml; 403402 bytes; 3118 bytes; application/pdf; text/plain

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0166218X9390043N
https://deepblue.lib.umich.edu/handle/2027.42/30833
https://deepblue.lib.umich.edu/bitstream/handle/2027.42/30833/0000495.pdf;sequence=1
https://www.sciencedirect.com/science/article/abs/pii/0166218X9390043N
https://dblp.uni-trier.de/db/journals/dam/dam42.html#ChungHMM93

2023 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC University of California, Irvine Irvine, CA, USA March 25–29, 2023.

Zdroj: Bulletin of Symbolic Logic; Dec2024, Vol. 29 Issue 4, p672-695, 24p

Témata: COMPUTATIONAL complexity, MATHEMATICAL equivalence, PROPOSITION (Logic), SET theory

Korporace: ASSOCIATION for Symbolic Logic

THE COMPLEXITY OF GENERIC PRIMAL ALGORITHMS FOR SOLVING GENERAL INTEGER PROGRAMS.

Autoři: Schulz, Andreas S. Weismantel, Robert

Zdroj: Mathematics of Operations Research; Nov2002, Vol. 27 Issue 4, p681, 12p

Témata: COMBINATORIAL optimization, INTEGER programming, ALGORITHMS, MATHEMATICAL optimization, POLYNOMIALS, COMPUTATIONAL complexity, VECTOR analysis

Single machine total tardiness maximization problems: complexity and algorithms.

Autoři: Gafarov, Evgeny Lazarev, Alexander Werner, Frank

Zdroj: Annals of Operations Research; Aug2013, Vol. 207 Issue 1, p121-136, 16p, 1 Chart

Témata: MACHINERY, TARDINESS, ALGORITHMS, DYNAMIC programming, COMPUTATIONAL complexity, CONSTRAINTS (Physics)

A note on the complexity of the transportation problem with a permutable demand vector.

Autoři: Hujter, Mihály Klinz, Bettina Woeginger, Gerhard J.

Zdroj: Mathematical Methods of Operations Research; 1999, Vol. 50 Issue 1, p9, 8p

Témata: TRANSPORTATION problems (Programming), COMPUTATIONAL complexity

RIEMANNIAN MULTIGRID LINE SEARCH FOR LOW-RANK PROBLEMS.

Autoři: SUTTI, MARCO VANDEREYCKEN, BART

Zdroj: SIAM Journal on Scientific Computing; 2021, Vol. 43 Issue 3, pA1803-A1831, 29p

Témata: LOW-rank matrices, ALGORITHMS, PROBLEM solving, SQUARE root, COMPUTATIONAL complexity, RIEMANNIAN manifolds, MULTIGRID methods (Numerical analysis)

Duality Gap in Interval Linear Programming.

Autoři: Novotná, Jana Hladík, Milan Masařík, Tomáš

Zdroj: Journal of Optimization Theory & Applications; Feb2020, Vol. 184 Issue 2, p565-580, 16p

Témata: COMPUTATIONAL complexity, INTERVAL analysis

Computational Complexity Theory and the Philosophy of Mathematics.

Autoři: Dean, Walter

Zdroj: Philosophia Mathematica; Oct2019, Vol. 27 Issue 3, p381-439, 59p

Témata: PHILOSOPHY of mathematics, COMPLEXITY (Philosophy), COMPUTATIONAL complexity, COMPUTABLE functions, COMPUTER science

A Multi-Objective Optimization Approach for Joint Channel Assignment and Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks.

Autoři: Vaezpour, Elaheh Dehghan, Mehdi

Zdroj: Wireless Personal Communications; Jul2014, Vol. 77 Issue 2, p1055-1076, 22p

Témata: WIRELESS mesh networks, GENETIC algorithms, NP-complete problems, ASSIGNMENT problems (Programming), COMPUTATIONAL complexity, COMPUTER networks

Reviews & Products: MATLAB (Computer software)

Stochastic programming approach to optimization under uncertainty.

Autoři: Shapiro, Alexander

Zdroj: Mathematical Programming; Mar2008, Vol. 112 Issue 1, p183-220, 38p

Témata: STOCHASTIC programming, DYNAMIC programming, MATHEMATICAL optimization, UNCERTAINTY (Information theory), MONTE Carlo method, COMPUTATIONAL complexity

NOTIONS OF TENSOR RANK.

Autoři: JUVEKAR, MANDAR NADJIMZADAH, ARIAN

Zdroj: Online Journal of Analytic Combinatorics; 2023, Issue 18, p1-17, 17p

Témata: COMPUTATIONAL complexity, FINITE fields, APPLICATION software, DATA analytics, COMPUTER science

SCORE-BASED PHYSICS-INFORMED NEURAL NETWORKS FOR HIGH-DIMENSIONAL FOKKER--PLANCK EQUATIONS.

Autoři: ZHEYUAN HU ZHONGQIANG ZHANG KARNIADAKIS, GEORGE E. a další

Zdroj: SIAM Journal on Scientific Computing; 2025, Vol. 47 Issue 3, pC680-C705, 39p

Témata: FOKKER-Planck equation, STOCHASTIC differential equations, DIMENSIONAL analysis, NUMERICAL analysis, MACHINE learning, MONTE Carlo method

The Quantum Measurement Problem and Physical reality: A Computation Theoretic Perspective.

Autoři: Srikanth, R.

Zdroj: AIP Conference Proceedings; 2006, Vol. 864 Issue 1, p178-193, 16p

Témata: QUANTUM theory, COMPUTATIONAL complexity, HILBERT space, NP-complete problems, TURING machines, HEISENBERG uncertainty principle, QUANTUM gravity

A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory.

Autoři: Cai, Jin-Yi Fu, Zhiguo Girstmair, Kurt a další

Zdroj: Computational Complexity; Jun2023, Vol. 32 Issue 1, p1-37, 37p

On the Complexity of Concurrent Multiset Rewriting.

Autoři: Bertier, Marin Perrin, Matthieu Tedeschi, Cédric

Zdroj: International Journal of Foundations of Computer Science; Jan2016, Vol. 27 Issue 1, p67-83, 17p

Témata: ISOMORPHISM (Mathematics), SUBGRAPHS, ALGORITHMS, DATA analysis, COMPUTATIONAL complexity, RULE-based programming