Výsledky vyhledávání - "efficient nondeterministic algorithm"

An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines

Autoři: R. Rodney Howell Louis E. Rosier

Zdroj: Lecture Notes in Computer Science ISBN: 3540167838

Témata: Computational Theory and Mathematics, efficient nondeterministic algorithm, Computer Networks and Communications, Analysis of algorithms and problem complexity, Applied Mathematics, nonemptiness, reversal-bounded multicounter machines, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, communicating finite state machines, 01 natural sciences, Theoretical Computer Science

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/4024795
https://doi.org/10.1016/0022-0000(87)90005-5
https://dl.acm.org/doi/abs/10.1016/0022-0000%2887%2990005-5
https://doi.org/10.1016/0022-0000(87)90005-5
https://dblp.uni-trier.de/db/journals/jcss/jcss34.html#HowellR87
https://www.sciencedirect.com/science/article/pii/0022000087900055
https://core.ac.uk/display/82450259
https://link.springer.com/chapter/10.1007/BFb0016267
https://rd.springer.com/chapter/10.1007/BFb0016267
https://link.springer.com/content/pdf/10.1007%2FBFb0016267.pdf
https://dblp.uni-trier.de/db/conf/mfcs/mfcs86.html#HowellR86

The Computational Advantage of MIP* Vanishes in the Presence of Noise.

Autoři: Dong, Yangjing Fu, Honghao Natarajan, Anand a další

Zdroj: Journal of the ACM; Dec2025, Vol. 72 Issue 6, p1-78, 78p

Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols.

Autoři: van Melkebeek, Dieter Mocelin Sdroievski, Nicollas

Zdroj: Computational Complexity; Dec2025, Vol. 34 Issue 2, p1-86, 86p

Complexity Theory.

Autoři: Rosenberg, Arnold L.

Zdroj: Pillars of Computation Theory; 2010, p245-297, 53p

An Efficient Algorithm for Temporal Abduction

Autoři: Vittorio Brusoni Luce Console Paolo Terenziani a další

Přispěvatelé: Vittorio Brusoni Luce Console Paolo Terenziani a další

Zdroj: http://www.di.unito.it/~krr/papers/aiia97eata.ps.Z.

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5323; http://www.di.unito.it/~krr/papers/aiia97eata.ps.Z

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5323
http://www.di.unito.it/~krr/papers/aiia97eata.ps.Z

The complexity of the capacitated tree problem.

Autoři: Papadimitriou, C. H.

Zdroj: Networks; Sep1978, Vol. 8 Issue 3, p217-230, 14p

Understanding Computation : Pillars, Paradigms, Principles

Autoři: Arnold L. Rosenberg Lenwood S. Heath

Resource Type: eBook.

Témata: Computer science

Categories: COMPUTERS / Computer Science

The Pillars of Computation Theory : State, Encoding, Nondeterminism

Autoři: Arnold L. Rosenberg

Resource Type: eBook.

Témata: Computational complexity, Theoretische Informatik

Categories: COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Logic

Parsing Theory

Autoři: Seppo Sippu Eljas Soisalon-Soininen

Resource Type: eBook.

Témata: Computer science, Machine theory, Compilers (Computer programs), Natural language processing (Computer science)

Categories: COMPUTERS / Computer Science, COMPUTERS / Programming / Compilers, COMPUTERS / Speech & Audio Processing