Some hardness escalation results in computational complexity theory par Kamath, Pritish.

Accéder au texte intégral

Extensions of Presburger arithmetic and model checking one-counter automata par Lechner, A

Sujets: “…Computational Complexity Theory…”

On nonintegral vertices of 3-SAT problem relaxation polytope par A. V. Nikolaev

Sujets: Accéder au texte intégral

P Systems with Evolutional Communication and Division Rules par David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez

Sujets: Accéder au texte intégral

18.404J / 6.840J Theory of Computation, Fall 2006 par Sipser, Michael

Sujets: “…Computability, computational complexity theory…”
Accéder au texte intégral

18.404J / 6.840J Theory of Computation, Fall 2002 par Sipser, Michael

Sujets: Accéder au texte intégral

Discrete Computation: Theory and Open Problems par Meyer, Albert R.

“…Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. …”
Accéder au texte intégral

The Spectral Norm of Finite Functions par Bellare, Mihir

“…In many recent results in learning and computational complexity theory which rely on Fourier analysis, the spectral norm plays a key role. …”
Accéder au texte intégral

A model-independent theory of computational complexity: from patience to precision and beyond par Blakey, E

“…<p>The field of computational complexity theory--which chiefly aims to quantify the difficulty encountered when performing calculations--is, in the case of conventional computers, correctly practised and well understood (some important and fundamental open questions notwithstanding); however, such understanding is, we argue, lacking when unconventional paradigms are considered. …”

Nonsequential Computation and Laws of Nature par Vitányi, Paul M.B.

“…Traditionally, computational complexity theory deals with sequential computations. …”
Accéder au texte intégral

QUANTUM DISCORD AND QUANTUM COMPUTING - AN APPRAISAL par Datta, A, Shaji, A

“…Completeness results from computational complexity theory lead to the identification of very disparate problems, and offer a kaleidoscopic view into the realm of quantum enhancements in computation. …”

Computational Structure of GPSG Models: Revised Generalized Phrase Structure Grammar par Ristad, Eric Sven

“…The primary goal of this report is to demonstrate how considerations from computational complexity theory can inform grammatical theorizing. …”
Accéder au texte intégral

Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review par Şakir Işleyen

“…The dominant sets problem by testing whether γ (G) ≤ K of a given graph is G and K input; It is an electronic card NP machines decision problem in computational complexity theory. Infographics, powerful infographics plus graphic mapping. …”
Accéder au texte intégral

Incremental FPT Delay par Arne Meier

“…These results are the first direct connections of collapses in parameterized enumeration complexity to collapses in classical enumeration complexity, parameterized function complexity, classical function complexity, and computational complexity theory.…”
Accéder au texte intégral

Contracting projected entangled pair states is average-case hard par Jonas Haferkamp, Dominik Hangleiter, Jens Eisert, Marek Gluza

“…In higher dimensions, however, a connection to the field of computational complexity theory has shown that the accurate normalization of the two-dimensional tensor networks called projected entangled pair states (PEPS) is #P-complete. …”
Accéder au texte intégral

A Survey of Noninteractive Zero Knowledge Proof System and Its Applications par Huixin Wu, Feng Wang

“…Zero knowledge proof system which has received extensive attention since it was proposed is an important branch of cryptography and computational complexity theory. Thereinto, noninteractive zero knowledge proof system contains only one message sent by the prover to the verifier. …”
Accéder au texte intégral

Unconventional complexity measures for unconventional computers par Blakey, E

“…One particular motivation behind unconventional computation is the desire efficiently to solve classically difficult problems—we recall chemical-computer attempts at solving NP-complete problems such as the Travelling Salesperson Problem—, with computational complexity theory offering the criteria for judging this efficiency. …”

R-prime numbers of degree k par Abdelhakim Chillali

“…Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. …”
Accéder au texte intégral

Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering par Aby Philip, Soorya Rethinasamy, Vincent Russo, Mark M. Wilde

“…Thus, our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory. They also demonstrate the value of a parameterized mid-circuit measurement in a VQSA.…”
Accéder au texte intégral

Real-Time Trading System Based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-Hard Combinatorial Optimization par Kosuke Tatsumura, Ryo Hidaka, Jun Nakayama, Tomoya Kashimata, Masaya Yamasaki

“…Financial portfolio construction problems are often formulated as quadratic and discrete (combinatorial) optimization that belong to the nondeterministic polynomial time (NP)-hard class in computational complexity theory. Ising machines are hardware devices that work in quantum-mechanical/quantum-inspired principles for quickly solving NP-hard optimization problems, which potentially enable making trading decisions based on NP-hard optimization in the time constraints for high-speed trading strategies. …”
Accéder au texte intégral