Suchergebnisse - "Nonnumerical algorithms"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: SIAM Journal on Discrete Mathematics. 39:946-972
Schlagwörter: connected domination, Connectivity, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), enumeration problems, degenerate graphs, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Analysis of algorithms, ddc:004, Enumeration in graph theory, Nonnumerical algorithms
Dateibeschreibung: application/xml; application/pdf
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 41st International Symposium on Computational Geometry (SoCG 2025)
https://hal.science/hal-04654840
41st International Symposium on Computational Geometry (SoCG 2025), Jun 2025, Kanazawa, Japan. pp.23:1-23:16, ⟨10.4230/LIPIcs.SoCG.2025.23⟩Schlagwörter: computational topology, structural graph parameters, Whitney embedding theorem, twin-width, triangulations, MSC: 57Q15 (Primary) 57R05, 05C75, 57M15 (Secondary), ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.10174; ARXIV: 2407.10174
-
3
Autoren: Forrest M. Anderson, Forrest
Schlagwörter: • Category Theory • Spectral Geometry • Noncommutative Geometry • Quantum Field Theory (QFT) • General Relativity • Gravity Quantization • Spectral Triple • Fluctuated Dirac Operator • Spectral Action Principle • Algebraic Unification • Gauge-Gravity Duality • Fermionic Bilinear • Operator-Theoretic Physics • Geometric Quantization • Mathematical Physics • Finite Element Method (FEM) • Spectral Approximation • Numerical Convergence • Bilinear Projection • Mesh Refinement • Sobolev Spaces • Eigenvalue Stability • Trace-Class Operators • Discretized Manifolds • Symbolic-to-Numerical Translation • IEEE 754 Compliance • Canonical Encoding • Deterministic Replay • Merkle Manifest • Cryptographic Attestation • Inclusion Proofs • Validator-Grade Verification • Reproducible Computation • Scientific Integrity • Manifest-Based Replication • MSC 81Txx – Quantum Theory • MSC 53Cxx – Differential Geometry • MSC 58Jxx – Partial Differential Equations on Manifolds • MSC 65N30 – FEM, PDEs • MSC 68P25 – Data Encoding and Compression • MSC 68Q87 – Cryptographic Protocols • ACM G.1.8 – Partial Differential Equations • ACM F.2.2 – Nonnumerical Algorithms and Problems • ACM D.4.6 – Security and Protection • ACM I.1.1 – Symbolic and Algebraic Manipulation • Alain Connes • Matilde Marcolli • Ivo Babuška • Ralph Merkle • IEEE Standards Association • Dan Boneh • Victor Shoup • Victoria Stodden • Gavin Wood • Scientific Reproducibility • Validator Framework • Cryptographic Verification • Open Science • Zenodo • arXiv • CERN • Mathematical Institute • Department of Applied Mathematics • Institute for Advanced Study
Relation: https://zenodo.org/records/17262968; oai:zenodo.org:17262968; https://doi.org/10.5281/zenodo.17262968
-
4
Autoren: et al.
Quelle: Theory of Computing Systems. 67:1241-1267
Schlagwörter: streaming algorithms, Analysis of algorithms and problem complexity, FPT, Combinatorial Optimization and Complexity Theory, Constraint Satisfaction Problems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Algorithmic Applications, 7. Clean energy, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), minor deletion problems, 0202 electrical engineering, electronic engineering, information engineering, Nonnumerical algorithms, Graph Algorithms, Computer science, vertex cover, subgraph deletion problems, Algorithm, Parameterized complexity, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, Fixed-Parameter Algorithms, Computer Science, Physical Sciences, Graph Theory and Algorithms, Parameterized Complexity
Dateibeschreibung: application/xml
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Journal of Computer and System Sciences. 124:159-169
Schlagwörter: Frobenius problem, FOS: Computer and information sciences, Combinatorial optimization, Analysis of algorithms and problem complexity, coin changing, Coin changing, 0102 computer and information sciences, text indexing, Dynamic programming, Algorithms on strings, 01 natural sciences, geometric data structures, fine-grained complexity, Computer Science - Data Structures and Algorithms, Analysis of algorithms, Data Structures and Algorithms (cs.DS), unbounded knapsack, 0101 mathematics, Nonnumerical algorithms, dynamic programming, orthogonal range reporting, orthogonal range successor, Combinatorics in computer science, knapsack, sorted range reporting, The Frobenius problem, orthogonal range search, ddc:004, word RAM, word-break problem
Dateibeschreibung: application/xml; application/pdf
Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2020/12895/pdf/LIPIcs-ESA-2020-29.pdf
http://arxiv.org/abs/2110.02503
http://arxiv.org/abs/2006.11978
http://export.arxiv.org/abs/2110.02503
https://arxiv.org/abs/2110.02503
https://arxiv.org/pdf/2110.02503.pdf
https://arxiv.org/abs/2110.02503
https://drops.dagstuhl.de/opus/volltexte/2020/12895/pdf/LIPIcs-ESA-2020-29.pdf/
https://arxiv.org/pdf/2110.02503
https://experts.illinois.edu/en/publications/more-on-change-making-and-related-problems
https://drops.dagstuhl.de/opus/volltexte/2020/12895/
https://dblp.uni-trier.de/db/journals/corr/corr2110.html#abs-2110-02503
https://www.sciencedirect.com/science/article/abs/pii/S002200002100088X
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.54
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.29 -
6
Autoren:
Quelle: Algorithmica. 84:2154-2185
Schlagwörter: Coloring of graphs and hypergraphs, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 0101 mathematics, Nonnumerical algorithms, 01 natural sciences
Dateibeschreibung: application/xml; application/pdf
-
7
Autoren:
Quelle: Operations Research Letters. 59:107217
Schlagwörter: Combinatorial optimization, matroid, local optimization, Analysis of algorithms, Combinatorics in computer science, Combinatorial aspects of matroids and geometric lattices, Combinatorial aspects of packing and covering, Nonnumerical algorithms, Operations research, mathematical programming, Approximation algorithms, approximation algorithm
Dateibeschreibung: application/xml
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 0925-8531.
Schlagwörter: Type-logical grammars, Proof theory, Proof nets, Parsing as deduction, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving/I.2.3.1: Deduction (e.g., natural, rule-based), ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO]Computer Science [cs]
-
9
Autoren:
Quelle: Lecture Notes in Computer Science ISBN: 9783030532611
Schlagwörter: dynamic programming, FOS: Computer and information sciences, Combinatorial optimization, 0102 computer and information sciences, Dynamic programming, 01 natural sciences, Euclidean plane, Graph theory (including graph drawing) in computer science, Computer graphics, computational geometry (digital and algorithmic aspects), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Manhattan distance, Mathematics - Combinatorics, combinatorial optimization, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), 0101 mathematics, Nonnumerical algorithms, geometric network design
Dateibeschreibung: application/xml
Zugangs-URL: http://arxiv.org/pdf/2004.11166
http://arxiv.org/abs/2004.11166
http://ui.adsabs.harvard.edu/abs/2020arXiv200411166M/abstract
https://link.springer.com/article/10.1007/s00453-021-00868-x
https://rd.springer.com/chapter/10.1007/978-3-030-53262-8_20
https://arxiv.org/abs/2004.11166
https://kyushu-u.pure.elsevier.com/ja/publications/dynamic-programming-approach-to-the-generalized-minimum-manhattan
https://dblp.uni-trier.de/db/journals/corr/corr2004.html#abs-2004-11166 -
10
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: abstract simplicial complexes, Computational Geometry (cs.CG), FOS: Computer and information sciences, Submanifold reconstruction, 65D18, convexity, I.3.5, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling, triangulation, F.2.2, 65D18, 57Q05, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, 57Q05, Computer Science - Computational Geometry, [INFO]Computer Science [cs], collapses, ddc:004
Dateibeschreibung: application/pdf
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; 39th International Symposium on Computational Geometry (SoCG 2023) ; https://hal.science/hal-04055617 ; 39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.42:1--42:18, ⟨10.4230/LIPIcs.SoCG.2023.42⟩
Schlagwörter: fixed-parameter tractability, generalized Heegaard splittings, JSJ decompositions, pathwidth, treewidth, triangulations, computational 3-manifold topology, MSC: 57Q15, 57N10, 05C75, 57M15, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Geographisches Schlagwort: Dallas, United States
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2303.06789; ARXIV: 2303.06789
-
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.science/hal-04654840 ; 2024.
Schlagwörter: triangulations, twin-width, Whitney embedding theorem, structural graph parameters, computational topology, MSC: 57Q15 (Primary) 57R05, 05C75, 57M15 (Secondary), ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.10174; ARXIV: 2407.10174
-
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics.
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
https://hal.science/hal-03573476
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2022.18⟩
https://stacs2022.sciencesconf.org/Schlagwörter: computability, tilings, effective subshift, sofic subshift, subshift of finite type, domino problem, aperiodicity, periodicity, subshift, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
-
14
Autoren: et al.
Quelle: 2018 IEEE Pacific Visualization Symposium (PacificVis). :1-10
Schlagwörter: Graph/Network Data, Geometry based Techniques, 11. Sustainability, Folding, Linear layouts, F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems, 0102 computer and information sciences, Routing and layout, 01 natural sciences
Zugangs-URL: https://research.tue.nl/en/publications/2e370ddf-e3bd-4d42-87f7-53d8bb312fdf
https://research.tue.nl/en/publications/optimal-algorithms -for-compact-linear-layouts-2
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ff550cf2b-aef8-4e45-ac94-300fb43ddd2c
https://ieeexplore.ieee.org/document/8365970/
https://dblp.uni-trier.de/db/conf/apvis/pacificvis2018.html#SonkeVMVS18
http://doi.ieeecomputersociety.org/10.1109/PacificVis.2018.00010 -
15
Autoren: et al.
Weitere Verfasser: et al.
Quelle: SAMOS XXI 2021 - 21st International Conference on embedded computer Systems: Architectures, MOdeling and Simulation ; https://inria.hal.science/hal-03488217 ; SAMOS XXI 2021 - 21st International Conference on embedded computer Systems: Architectures, MOdeling and Simulation, Jul 2021, Virtual, France. pp.1-12
Schlagwörter: Antiviral action, Dengue, Flavonoid, Hepatitis C virus, Influenza, Quercetin, SARSCOV-2, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.5: Sequencing and scheduling, [INFO]Computer Science [cs]
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: SICS Software-Intensive Cyber-Physical Systems. 35:127-139
Schlagwörter: Nonnumerical Algorithms and Problems (CR F.2.2), Pattern Languages, 4. Education, Software Engineering Software Architectures (CR D.2.11), Discrete Mathematics Graph Theory (CR G.2.2), Internet of Things, 0202 electrical engineering, electronic engineering, information engineering, Entry Points, 02 engineering and technology, Distributed Systems (CR C.2.4), 10. No inequality, 3. Good health
-
17
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9783319492582
Schlagwörter: [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO]Computer Science [cs], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure
Dateibeschreibung: application/pdf
Zugangs-URL: https://link.springer.com/article/10.1007/s00224-017-9828-z
https://hal.archives-ouvertes.fr/hal-01894618
https://doi.org/10.1007/s00224-017-9828-z
https://dblp.uni-trier.de/db/journals/mst/mst63.html#BalabonskiDRTU19
https://rd.springer.com/chapter/10.1007/978-3-319-49259-9_2
https://doi.org/10.1007/978-3-319-49259-9_2
https://hal.archives-ouvertes.fr/hal-01491813
https://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://link.springer.com/chapter/10.1007/978-3-319-49259-9_2
http://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://hal.science/hal-01894618v1/document
https://doi.org/10.1007/s00224-017-9828-z
https://hal.science/hal-01894618v1
https://hal.sorbonne-universite.fr/hal-01491813v1
https://doi.org/10.1007/978-3-319-49259-9_2 -
18
Autoren: et al.
Weitere Verfasser: et al.
Quelle: EISSN: 2750-7823 ; Computing in Geometry and Topology ; https://hal.science/hal-03373577 ; Computing in Geometry and Topology, 2022, 1 (1), pp.1:1-1:19. ⟨10.57717/cgt.v1i1.4⟩ ; https://www.cgt-journal.org/
Schlagwörter: computational 3-manifold topology, fixed-parameter tractability, generalized Heegaard splittings, pathwidth, treewidth, hyperbolic 3-manifolds, thick-thin decomposition, volume, complexité paramétrée, décomposition épaisse-fine, 3-variétés hyperboliques, largeur arborescente, largeur arborescente linéaire, divisions de Heegaard généralisées, solubilité à paramètre fixé, topologie algorithmique des 3-variétés, MSC 57Q15, 57N10, 05C75, 57M15, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2105.11371; ARXIV: 2105.11371
-
19
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation ; https://hal.science/hal-03014372 ; Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France ; https://www.didapro.org/8/
Schlagwörter: complexité, algorithme, problème, didactique, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [SHS.EDU]Humanities and Social Sciences/Education
Relation: https://hal.science/hal-02474983v1
-
20
Autoren: et al.
Quelle: J Autom Reason
Beyersdorff, O, Blinkhorn, J, Leroy Chew, Schmidt, R & Suda, M 2018, 'Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF', Journal of Automated Reasoning, vol. 63, no. 0, pp. 597–623. https://doi.org/10.1007/s10817-018-9482-4
Journal of Automated ReasoningSchlagwörter: Dependency schemes, 0202 electrical engineering, electronic engineering, information engineering, DQBF, Quantified Boolean formulas, 0102 computer and information sciences, 02 engineering and technology, F.2.2 Nonnumerical algorithms and problems, 01 natural sciences, Article
Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs10817-018-9482-4.pdf
https://pubmed.ncbi.nlm.nih.gov/31496547
https://www.research.manchester.ac.uk/portal/en/publications/reinterpreting-dependency-schemes-soundness-meets-incompleteness-in-dqbf(c21330aa-c463-4cf7-b62a-9963d26aaad7).html
https://link.springer.com/content/pdf/10.1007/s10817-018-9482-4.pdf
https://europepmc.org/article/PMC/PMC6710225
https://link.springer.com/article/10.1007/s10817-018-9482-4
https://dblp.uni-trier.de/db/journals/jar/jar63.html#BeyersdorffBCSS19
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6710225
Nájsť tento článok vo Web of Science 
Full Text Finder