Suchergebnisse - "Nonnumerical Algorithms and Problems"
-
1
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
-
2
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
-
3
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
-
4
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
-
5
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
-
6
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]
-
7
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 -
8
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
-
9
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
-
10
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 -
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Journal of Computational Geometry. 8(2):3-31
Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, 4. Education, 1. No poverty, Computer Science - Computational Geometry, F.2.2, I.3.5, 0102 computer and information sciences, ddc:004, Nonnumerical Algorithms and Problems,Computational Geometry and Object Modeling, 01 natural sciences, 7. Clean energy
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/1603.03818
https://drops.dagstuhl.de/opus/volltexte/2016/5937/
https://dblp.uni-trier.de/db/conf/compgeom/compgeom2016.html#KanjPT16
https://doi.org/10.4230/LIPIcs.SoCG.2016.45
http://ui.adsabs.harvard.edu/abs/2016arXiv160303818K/abstract
https://jocg.org/index.php/jocg/article/download/3042/2766
https://dblp.uni-trier.de/db/journals/corr/corr1603.html#KanjPT16
https://jocg.org/index.php/jocg/article/view/3042
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.45 -
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 0020-0190 ; Information Processing Letters ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01674319 ; Information Processing Letters, 2020, 155, pp.#105862. ⟨10.1016/j.ipl.2019.105862⟩.
Schlagwörter: Aho-Corasik, greedy, superstring, suffix, overlap graph, assembly, digraph, prefix, stringology, APSP, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]
-
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.archives-ouvertes.fr/hal-03373577 ; 2021.
Schlagwörter: computational 3-manifold topology, fixed-parameter tractability, generalized Heegaard splittings, pathwidth, treewidth, hyperbolic 3-manifolds, thick-thin decomposition, volume, topologie algorithmique des 3-variétés, complexité paramétrée, solubilité à paramètre fixé, divisions de Heegaard généralisées, largeur arborescente linéaire, largeur arborescente, 3-variétés hyperboliques, décomposition épaisse-fine, 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; hal-03373577; https://hal.archives-ouvertes.fr/hal-03373577; https://hal.archives-ouvertes.fr/hal-03373577/document; https://hal.archives-ouvertes.fr/hal-03373577/file/arxiv_v1.pdf; ARXIV: 2105.11371
-
14
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Journal of Symbolic Computation. 70:49-70
Schlagwörter: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Computer Science - Symbolic Computation, FOS: Computer and information sciences, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], Complexity, Symbolic Computation (cs.SC), 16. Peace & justice, 01 natural sciences, Noether Position, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, Regular Sequences, 13. Climate action, Gröbner bases, F5 algorithm, 0101 mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/1312.1655
https://www.sciencedirect.com/science/article/abs/pii/S0747717114000935
https://arxiv.org/pdf/1312.1655
https://dblp.uni-trier.de/db/journals/corr/corr1312.html#BardetFS13
https://arxiv.org/abs/1312.1655
https://dl.acm.org/doi/10.1016/j.jsc.2014.09.025
https://hal.inria.fr/hal-01064519/document -
15
Autoren:
Weitere Verfasser:
Schlagwörter: Pattern Matching, Life and Medical Sciences, ddc:004, Nonnumerical Algorithms and Problems, Pattern Matching, Algorithms, Life and Medical Sciences, Nonnumerical Algorithms and Problems, Algorithms
Dateibeschreibung: application/pdf
-
16
Autoren:
Weitere Verfasser:
Schlagwörter: Combinatorics, Graph Theory, Formal Languages, Models of Computation, Mathematical Logic, Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory, ddc:004, Nonnumerical Algorithms and Problems
Dateibeschreibung: application/pdf
-
17
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Analysis of Algorithms and Problem Complexity, Online computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems [Network Architecture and Design, Coding and Information Theory, Error Control Codes, Modes of Computation], Coding and Information Theory, ddc:004, Complexity Measures and Classes, Error Control Codes, Nonnumerical Algorithms and Problems, Modes of Computation: Online computation, Numerical Algorithms and Problems, Network Architecture and Design
Dateibeschreibung: application/pdf
-
18
Autoren:
Weitere Verfasser:
Schlagwörter: Discrete Mathematics, Analysis of Algorithms and Problem Complexity, ddc:004, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics
Dateibeschreibung: application/pdf
-
19
Autoren:
Weitere Verfasser:
Schlagwörter: Optimization, Mathematical Software, Control Methods, Discrete Mathematics, AlgorithmsProblem Solving, and Search, ddc:004, Data Structures, Nonnumerical Algorithms and Problems, Computational Geometry and Object Modeling, Data Structures, Nonnumerical Algorithms and Problems, Optimization, Discrete Mathematics, Mathematical Software, AlgorithmsProblem Solving, Control Methods, and Search, Computational Geometry and Object Modeling
Dateibeschreibung: application/pdf
-
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; 25th Annual European Symposium on Algorithms (ESA 2017) ; https://hal.science/hal-01740357 ; 25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩
Schlagwörter: Combinatorial Optimization, Expansion, Hall's Theorem, Local Search, Planar Graphs, ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, [SCCO.COMP]Cognitive science/Computer science
Nájsť tento článok vo Web of Science 
Full Text Finder