Suchergebnisse - "((\"mathematik logic AND algorithm theory\") OR (\"mathematik logic AND algorithm theory\"))~"

Parameterised Counting in Logspace

Autoren: Haak, Anselm Meier, Arne Prakash, Om et al.

Weitere Verfasser: Haak, Anselm Meier, Arne Prakash, Om et al.

Quelle: Algorithmica. 85:2923-2961

Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Logspace, edit distance, Counting complexity, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Dewey Decimal Classification::500 | Naturwissenschaften::510 | Mathematik, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, Parameterized complexity, Dewey Decimal Classification::000 | Allgemeines, Wissenschaft::000 | Informatik, Wissen, Systeme::004 | Informatik, Computer Science - Data Structures and Algorithms, sketching, 0202 electrical engineering, electronic engineering, information engineering, Counting Complexity, Data Structures and Algorithms (cs.DS), ddc:004, Parameterized Complexity

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1904.12156
http://arxiv.org/abs/2010.13170
https://dblp.uni-trier.de/db/conf/stacs/stacs2021.html#HaakM0R21
https://drops.dagstuhl.de/opus/volltexte/2021/13685/pdf/LIPIcs-STACS-2021-40.pdf/
https://doi.org/10.4230/LIPIcs.STACS.2021.40
https://drops.dagstuhl.de/opus/volltexte/2021/13685/
https://dblp.uni-trier.de/db/conf/stacs/stacs2021.html#JinN021
https://doi.org/10.4230/LIPIcs.STACS.2021.45
https://drops.dagstuhl.de/opus/volltexte/2021/13690/pdf/LIPIcs-STACS-2021-45.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13690/
https://arxiv.org/abs/2010.13170
https://arxiv.org/pdf/2010.13170
https://ui.adsabs.harvard.edu/abs/2020arXiv201013170J/abstract
https://arxiv.org/abs/1904.12156
https://arxiv.org/pdf/1904.12156.pdf
https://ui.adsabs.harvard.edu/abs/2019arXiv190412156H/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.45
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.40
https://escholarship.org/uc/item/2p1465kt

Computability theory

Autoren: Zimmermann, Karl-Heinz

Schlagwörter: Models of Computation (F.4.1), F.1.3:Complexity Measures and Classes (F.2) (REVISED), F.1.2:Modes of Computation, computability theory, complexity theory, 03-XX, Komplexitätstheorie, Turing machine, Computability, recursion theory, Turing machine, undecidability, word problems, complexity classes, Berechenbarkeit, Ingenieurwissenschaften, theoretical computer science, Theoretische Informatik, Grammars and Other Rewriting Systems (D.3.1), Rekursionstheorie, F.1.1:Models of Computation (F.4.1), computability, Computability, 510: Mathematik, recursion theory, undecidability, word problems, complexity classes, Unentscheidbarkeit, Mathematik, 03-XX:Mathematical logic and foundations, F.1.2, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3), F.1.3, Algebraische Rekursionstheorie, complexity, F.1.1, Mathematical Logic (F.1.1, I.2.2-4)

Concurrency Makes Simple Theories Hard

Autoren: Göller, Stefan Widjaja Lin, Anthony Fachbereich Mathematik und Informatik Bremen et al.

Weitere Verfasser: Göller, Stefan Widjaja Lin, Anthony Fachbereich Mathematik und Informatik Bremen et al.

Quelle: Symposium on Theoretical Aspects of Computer Science ; STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) ; https://hal.archives-ouvertes.fr/hal-00678192 ; STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.148-159

Schlagwörter: Modal Logic, Model Checking, Asynchronous Product, Pushdown Systems, Feferman-Vaught, Nonelementary lower bounds, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geographisches Schlagwort: Paris, France

Relation: hal-00678192; https://hal.archives-ouvertes.fr/hal-00678192; https://hal.archives-ouvertes.fr/hal-00678192/document; https://hal.archives-ouvertes.fr/hal-00678192/file/37.pdf

Verfügbarkeit: https://hal.archives-ouvertes.fr/hal-00678192
https://hal.archives-ouvertes.fr/hal-00678192/document
https://hal.archives-ouvertes.fr/hal-00678192/file/37.pdf

Lecture 17: Nondeterministic Constraint Logic

Autoren: Massachusetts Institute of Technology Erik Demaine

Schlagwörter: Engineering, Computer Science, Mathematics, Computation, Algorithms and Data Structures, Theory of Computation, Studienbereich Informatik, Mathematik, Ingenieurwissenschaften, Naturwissenschaften

Verfügbarkeit: https://ocw.mit.edu/courses/6-890-algorithmic-lower-bounds-fun-with-hardness-proofs-fall-2014/resources/lecture-17-nondeterministic-constraint-logic/

Θεμελίωση επιστήμης υπολογιστών

Autoren: Efstathios Zachos Aristeidis Pagourtzis Theodora Souliou et al.

Weitere Verfasser: Efstathios Zachos Aristeidis Pagourtzis Theodora Souliou et al.

Schlagwörter: Algorithms, Search Algorithms, Sorting Algorithms, Algorithmic Composition, Graphs, Graph Algorithms, Graph Theory, String Algorithms, Computability, Computational Complexity, Data Structures, Automata, Formal Languages, Grammars, Parallel Algorithms, Distributed Algorithms, Knowledge Representation And Reasoning, Logic And Circuits, Logic, Logic For Computer Science, Studienbereich Informatik, Mathematik, Naturwissenschaften, Ingenieurwissenschaften

Relation: https://repository.kallipos.gr/handle/11419/5452

Verfügbarkeit: https://repository.kallipos.gr/handle/11419/5452
http://repository.kallipos.gr/bitstream/11419/5452/2/Kallipos_Zachos_Full-KOY.pdf

Preface — Special Issue: Research in Combinatorial Optimization and Applications of COCOA 2021.

Autoren: Du, Donglei Han, Lu Möhring, Rolf H. et al.

Quelle: International Journal of Foundations of Computer Science. Sep2024, Vol. 35 Issue 6, p605-607. 3p.

Schlagwörter: *COMPUTER science, LOGIC circuits, GRAPH theory, COMBINATORIAL optimization, ROUTING algorithms, BIPARTITE graphs, APPROXIMATION algorithms

Aircraft Trajectory Tracking Using Radar Equipment with Fuzzy Logic Algorithm.

Autoren: Raboaca, Maria Simona Dumitrescu, Catalin Manta, Ioana

Quelle: Mathematics (2227-7390); Feb2020, Vol. 8 Issue 2, p207, 1p

Schlagwörter: FUZZY logic, RADAR equipment, FUZZY algorithms, TRACKING radar, SET theory, RADAR, SURVEILLANCE radar, RADARSAT satellites

Distinguishing next society.

Autoren: Baecker, Dirk

Quelle: Current Sociology; Jul2025, Vol. 73 Issue 4, p493-508, 16p

Schlagwörter: MACHINE learning, COMPUTER systems, DIGITAL communications, SOCIAL systems, DIGITAL technology

Item Classification by Difficulty Using Functional Principal Component Clustering and Neural Networks.

Autoren: Zoucha, James Himelfarb, Igor Tang, Nai-En

Quelle: Educational & Psychological Measurement; Jun2025, Vol. 85 Issue 3, p429-457, 29p

Schlagwörter: CLUSTER analysis (Statistics), DATA analysis, CLUSTERING algorithms, T-test (Statistics), RESEARCH methodology evaluation, MULTIPLE regression analysis, PROBABILITY theory, LOGISTIC regression analysis, EDUCATIONAL tests & measurements, DESCRIPTIVE statistics, ARTIFICIAL neural networks, STATISTICS, LOGIC, MULTIDIMENSIONAL scaling, MACHINE learning, FACTOR analysis, CONFIDENCE intervals, ALGORITHMS, TEST design, SENSITIVITY & specificity (Statistics)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.

Autoren: Grohe, Martin Lichter, Moritz Neuen, Daniel et al.

Quelle: Journal of the ACM; Jun2025, Vol. 72 Issue 3, p1-27, 27p

Schlagwörter: GRAPH theory, ISOMORPHISM (Mathematics), COMBINATORIAL optimization, MACHINE learning, OPEN-ended questions

A Short Note on the Early History of the Spectrum Problem and Finite Model Theory.

Autoren: Reichenberger, Andrea

Quelle: History & Philosophy of Logic; May2025, Vol. 46 Issue 2, p287-296, 10p

Schlagwörter: FINITE model theory, MATHEMATICS, MATHEMATICAL logic, COMPUTER science, COMPUTATIONAL mathematics

Enhanced logic-based Benders decomposition methods for the distributed heterogeneous non-permutation flow shop scheduling problem.

Autoren: Xiong, Fuli Jing, Lin Xiong, Ningxin et al.

Quelle: International Journal of Production Research; Dec2025, Vol. 63 Issue 24, p10517-10554, 38p

Splitting a Disjunctive Logic Program.

Autoren: BEN-ELIYAHU-ZOHARY, RACHEL

Quelle: Theory & Practice of Logic Programming; Jul2025, Vol. 25 Issue 4, p507-521, 15p

Schlagwörter: POLYNOMIAL time algorithms, LOGIC programming, NONMONOTONIC logic, COMPUTER science

Speeding Up Floyd–Warshall's Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph.

Autoren: Lancia, Giuseppe Dalpasso, Marcello

Quelle: Algorithms; Sep2025, Vol. 18 Issue 9, p560, 19p

Schlagwörter: GRAPH theory, GRAPH algorithms, MATHEMATICAL optimization, ALGORITHMS, DYNAMIC programming

The Borel complexity of the class of models of first-order theories.

Autoren: Andrews, Uri Gonzalez, David Lempp, Steffen et al.

Quelle: Proceedings of the American Mathematical Society; Sep2025, Vol. 153 Issue 9, p4013-4024, 12p

Schlagwörter: FIRST-order logic, SCIENTIFIC models, PHILOSOPHY of science

Enhanced Cubic Spline Interpolation Method Incorporating Trapezoidal Fuzzy Number.

Autoren: Karpagam, A. Suguna, M.

Quelle: Palestine Journal of Mathematics; 2025, Vol. 14 Issue 3, p581-589, 9p

Schlagwörter: INTERPOLATION, FUZZY numbers, FUZZY algorithms, COMPUTATIONAL intelligence, UNCERTAINTY (Information theory), MATHEMATICAL models, NONLINEAR functions, FUZZY mathematics

A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems: A new general approach to the theory of the many-one equivalence of decision problems for algorithmic systems

Autoren: BORGER, EGON

Quelle: Mathematical Logic Quarterly. 25:135-162

Schlagwörter: partial implicational propositional calculus in two variables, representation theorems, Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations, semi-Thue system, recursive reduction, recursive classes of first-order logical formulae with equality, 0102 computer and information sciences, Thue and Post systems, etc, Automata and formal grammars in connection with logical questions, 01 natural sciences, Turing machine, partial recursive functions, Decidability of theories and sets of sentences, algorithmic systems, Turing machines and related notions, Other degrees and reducibilities in computability and recursion theory, many-one equivalence, word problem of Thue systems, 0101 mathematics, Markov algorithm, Word problems, etc. in computability and recursion theory, decision problems, register machine, Post normal calculus

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3668573
https://doi.org/10.1002/malq.19790250707
https://core.ac.uk/display/54850921
https://arpi.unipi.it/handle/11568/280
http://onlinelibrary.wiley.com/doi/10.1002/malq.19790250707/abstract
https://hdl.handle.net/11568/280

Balancing U-shaped assembly lines with collaborative robots: constraint programming approaches and Benders' decomposition algorithms.

Autoren: Zheng, Chenyu Li, Zixiang Ponnambalam, S. G.

Quelle: International Journal of Production Research; Dec2025, Vol. 63 Issue 24, p10468-10489, 22p

2024 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC, LOGIC COLLOQUIUM 2024 University of Gothenburg Gothenburg, Sweden 24 June – 28 June, 2024.

Quelle: Bulletin of Symbolic Logic; Dec2024, Vol. 30 Issue 4, p580-614, 35p

Schlagwörter: MATHEMATICAL proofs, COMPUTER logic, PHILOSOPHY of science, MATHEMATICAL logic, DISCRETE mathematics, WORD problems (Mathematics), RAMSEY numbers, PROOF theory, KOLMOGOROV complexity

INTERNAL AND EXTERNAL CALCULI: ORDERING THE JUNGLE WITHOUT BEING LOST IN TRANSLATIONS.

Autoren: Lyon, Tim S. Ciabattoni, Agata Galmiche, Didier et al.

Quelle: Bulletin of the Section of Logic; Mar2025, Vol. 54 Issue 1, p59-151, 93p

Schlagwörter: PROOF theory, NONCLASSICAL mathematical logic, INTUITIONISTIC mathematics, CONDITIONALS (Logic)