• Suche: "ACM: F.: Theory of Computation"

Treffer 21 - 40 von 1.805

21

MyOPE: Malicious SecuritY for Oblivious Polynomial Evaluation
Izabachène, Malika ; Nitulescu, Anca ; de Perthuis, Paola ; et al.
SCN 2022 - 13th Conference on Cryptography and Security for Networks. :663-686

Amalfi, Italy ACM: F.: Theory of Compu... ACM: G.: Mathematics of... [INFO.INFO-CR]Computer S... Cryptography and Securit...
Konferenz
Zu den Favoriten
22

Resilience in Discrete Event Systems
Fabre, Eric ; SUpervision of large MOdular and distributed systems (SUMO) ; Centre Inria de l'Université de Rennes ; et al.
WODES 2022 - 16th IFAC Workshop on Discrete Event Systems. :1-6

Prague, Czech Republic ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.3: Formal Languages F.4.3.4: Operations on l... [INFO.INFO-CC]Computer S... …
Konferenz
Zu den Favoriten
23

SAT in Polynomial Time: A Proof of P = NP
Vega, Frank ; Information Physics Institute (IPI)

complexity classes graph polynomial time completeness reduction 68Q15, 68Q17, 68Q25 …
E-Ressource
Zu den Favoriten
24

Implementing number theoretic transforms
van der Hoeven, Joris ; Lecerf, Grégoire ; Centre National de la Recherche Scientifique (CNRS) ; et al.

number theoretic transfo... finite fields codelets algorithm complexity bound integer multiplication …
E-Ressource
Zu den Favoriten
25

On the P Versus NP Problem
Vega, Frank ; Information Physics Institute (IPI)

complexity classes graph polynomial time completeness reduction MSC 68Q15, 68Q17, 68Q25 …
E-Ressource
Zu den Favoriten
26

When alpha-complexes collapse onto codimension-1 submanifolds
Attali, Dominique ; Clémot, Mattéo ; Dornelas, Bianca, B. ; et al.

Submanifold reconstructi... triangulation abstract simplicial comp... collapses convexity 65D18, 57Q05 …
E-Ressource
Zu den Favoriten
27

Note for the P versus NP Problem (II)
Vega, Frank ; Information Physics Institute (IPI)

Complexity classes Completeness Polynomial time Reduction Graph Primary 68Q15; Secondary... …
E-Ressource
Zu den Favoriten
28

About the zeros of analytic functions that exhibit symmetry
Utilisation d'un système d'équations pour étudier l'hypothèse de Riemann
Zilpa, Yonatan ; Technion - Israel Institute of Technology [Haifa]

Abel-Plana Formula Riemann Zeta functions Riemann Zeta functions A... Symmetry Number theory Perturbation Equations …
E-Ressource
Zu den Favoriten
29

Deterministic factoring with oracles
Factorisation d'entiers déterministes à l'aide d'oracles
Morain, François ; Renault, Guénaël ; Smith, Benjamin ; et al.
Applicable Algebra in Engineering. 34(4):663-690

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... F.2.1.4: Number-theoreti... [MATH.MATH-NT]Mathematic... Number Theory [math.NT] …
Zeitschrift
Zu den Favoriten
30

The aperiodic Domino problem in higher dimension
Le problème du Domino apériodique en dimension supérieure
de Menibus, Benjamin Hellouin ; Callard, Antonin ; Graphes, Algorithmes et Combinatoire - LISN (GALaC) ; et al.
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). :1-15

Marseille, France subshift periodicity aperiodicity domino problem subshift of finite type …
Konferenz
Zu den Favoriten
31

Notes on overt choice
Hoyrup, Mathieu ; Designing the Future of Computational Models (MOCQUA) ; Centre Inria de l'Université de Lorraine ; et al.
Computability. :1-19

overt choice quasi-Polish space Weihrauch degree represented space computable analysis ACM: F.: Theory of Compu... …
Zeitschrift
Zu den Favoriten
32

Proving Termination With CPO --Full Version
Díaz-Caro, Alejandro ; Dowek, Gilles ; Jouannaud, Jean-Pierre ; et al.

Quantum calculi Computability path order... Path orderings Termination proof Higher-order rewrite rul... Typed lambda calculus …
Zu den Favoriten
33

Note for the P versus NP Problem
Vega, Frank ; Information Physics Institute (IPI)
IPI Letters, 2024, ⟨10.59973/ipil.92⟩

Complexity classes Completeness Polynomial time Boolean formula Graph Primary 68Q15; Secondary... …
Zeitschrift
Zu den Favoriten
34

Zeta Functions and the (Linear) Logic of Markov Processes
Seiller, Thomas ; Centre National de la Recherche Scientifique (CNRS) ; Laboratoire d'Informatique de Paris-Nord (LIPN) ; et al.
Logical Methods in Computer Science. 20(3)

ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... F.1.2: Modes of Computat... F.1.2.4: Probabilistic c... F.3: LOGICS AND MEANINGS... F.3.2: Semantics of Prog... …
Zeitschrift
Zu den Favoriten
35

Local Optimization Algorithms for Maximum Planar Subgraph
Călinescu, Gruia ; Uniyal, Sumedha ; Illinois Institute of Technology ; et al.

2012 ACM Subject Classif... planar graph maximum subgraph approximation algorithm matroid parity local optimization …
E-Ressource
Zu den Favoriten
36

On the twin-width of smooth manifolds
Bonnet, Édouard ; Huszár, Kristóf ; Modèles de calcul, Complexité, Combinatoire (MC2) ; et al.

triangulations twin-width Whitney embedding theore... structural graph paramet... computational topology MSC: 57Q15 (Primary) 57R... …
E-Ressource
Zu den Favoriten
37

A Framework for Fixed Priority Periodic Scheduling Synthesis from Synchronous Data-flow Graphs
Tran, Hai, Nam ; Honorat, Alexandre ; Bhattacharyya, Shuvra, S ; et al.
SAMOS XXI 2021 - 21st International Conference on embedded computer Systems: Architectures. :1-12

Virtual, France Antiviral action Dengue Flavonoid Hepatitis C virus Influenza …
Konferenz
Zu den Favoriten
38

Processes, Systems & Tests: Defining Contextual Equivalences
Aubert, Clément ; Varacca, Daniele ; Augusta University ; et al.
Proceedings 14th Interaction and Concurrency Experience (ICE 2021). :1-21

Virtual Event, Malta Process Algebra Concurrency Testing Equivalences Process Semantics ACM: D.: Software …
Konferenz
Zu den Favoriten
39

A Direct Formal Semantics for BPMN Time-Related Constructs
Houhou, Sara ; Baarir, Souheib ; Poizat, Pascal ; et al.
ENASE 2021 - 16th International Conference on Evaluation of Novel Approaches to Software Engineering. :138-149

online, Czech Republic Formal Verification Alloy Collaborations Workflows Timed Models …
Konferenz
Zu den Favoriten
40

Computable Measure Theory and Algorithmic Randomness
Hoyrup, Mathieu ; Rute, Jason ; Designing the Future of Computational Models (MOCQUA) ; et al.
Handbook of Computable Analysis. :227-270

ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... F.1.1: Models of Computa... F.1.1.2: Computability t... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi... …
Buch
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter