Concept

Nondeterministic Turing machine

Related publications (39)

A PCP Theorem for Interactive Proofs and Applications

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Beam transfer function measurements used to probe the transverse Landau damping at the LHC

Xavier Buffat, Tatiana Pieloni, Javier Barranco Garcia, Claudia Tambasco

The Landau damping mechanism stabilizes the impedance driven head-tail modes in hadron synchrotrons. Because of the frequent coherent beam instabilities observed in the Large Hadron Collider in 2012, the Landau damping of the beams was doubted. Therefore, ...

AMER PHYSICAL SOC2020

Wind profile prediction in an urban canyon: a machine learning approach

Roberto Castello, Jean-Louis Scartezzini, Dasaraden Mauree, Tianchu Zhang, Gianluca Mancini, Tullio Nutta

Resolving the wind profile in an urban canyon environment means dealing with the turbulent nature of the stream and the presence of non-negligible flux exchanges with the atmosphere inside the canopy, making any deterministic model solution computationally ...

IOP2019

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

Formal Analysis of Human-Assisted Smart City Emergency Services

The concept of IoT-based Smart Cities has gained momentum in recent years. The research in this domain has focused on modeling key characteristics of future smart cities along with exploring their design and implementation aspects from multiple perspective ...

2019

Block Oriented Programming: Automating Data-Only Attacks

Mathias Josef Payer

With the widespread deployment of Control-Flow Integrity (CFI), control-flow hijacking attacks, and consequently code reuse attacks, are significantly more difficult. CFI limits control flow to well-known locations, severely restricting arbitrary code exec ...

ASSOC COMPUTING MACHINERY2018

DEMO design activity in Europe: Progress and updates

Minh Quang Tran

This paper describes the progress of the DEMO Design Activities in Europe and particularly the work done to address critical design integration issues that affect the machine configuration and performance, the plant concept layout and the selection of syst ...

2018

Towards self-consistent plasma modelisation in presence of Neoclassical Tearing Mode and sawteeth: effects on transport coefficients

Olivier Sauter

The neoclassical tearing modes (NTM) increase the effective heat and particle radial transport inside the plasma, leading to a flattening of the electron and ion temperature and density profiles at a given location depending on the safety factor q ration ...

2017

An empirical study on the characterization of machined surface integrity by chip morphology in dry end-milling of titanium alloy

Muhammad Arif

Titanium alloys manifest low thermal conductivity and high work hardenability in machining. These alloys are thus considered as difficult-to-machine at higher cutting speeds and pose serious problems in machining such as degraded machined surface and rapid ...

Professional Engineering Publishing2014

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.