Výsledky vyhledávání - Nondeterministic parallel complexity classes

On nondeterminism in parallel computation

Autoři: P W Dymond

Zdroj: Theoretical Computer Science. 47:111-120

Témata: Nondeterministic parallel complexity classes, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, hardware modification machine, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/4041260
https://doi.org/10.1016/0304-3975(86)90139-8
https://www.sciencedirect.com/science/article/pii/0304397586901398
https://www.sciencedirect.com/science/article/abs/pii/0304397586901398
https://dblp.uni-trier.de/db/journals/tcs/tcs47.html#Dymond86
https://core.ac.uk/display/82452035
https://doi.org/10.1016/0304-3975(86)90139-8

Robustness for Space-Bounded Statistical Zero Knowledge: Robustness for space-bounded statistical zero knowledge

Autoři: Eric Allender Jacob Gray Saachi Mutreja a další

Přispěvatelé: Eric Allender Jacob Gray Saachi Mutreja a další

Zdroj: ACM Transactions on Computation Theory. 17:1-25

Témata: interactive proofs, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Interactive Proofs, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Communication complexity, information complexity, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/8029725
https://doi.org/10.1145/3708508
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.56

Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs: Complexity theoretical results on nondeterministic graph-driven read-once branching programs

Autoři: Beate Bollig

Zdroj: Lecture Notes in Computer Science ISBN: 9783540006237

Témata: Computational complexity, nondeterminism, lower bounds, 4. Education, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, Models of computation (Turing machines, etc.), read-once branching programs, 16. Peace & justice, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: http://www.numdam.org/item/10.1051/ita:2003010.pdf
https://zbmath.org/2066226
https://doi.org/10.1051/ita:2003010
https://rd.springer.com/chapter/10.1007/3-540-36494-3_27
https://link.springer.com/chapter/10.1007%2F3-540-36494-3_27
https://dblp.uni-trier.de/db/conf/stacs/stacs2003.html#Bollig03
https://www.rairo-ita.org/articles/ita/abs/2003/01/ita0302bis/ita0302bis.html
http://www.rairo-ita.org/articles/ita/abs/2003/01/ita0302bis/ita0302bis.html
https://dblp.uni-trier.de/db/journals/ita/ita37.html#Bollig03
https://www.cambridge.org/core/journals/rairo-theoretical-informatics-and-applications/article/complexity-theoretical-results-on-nondeterministic-graphdriven-readonce-branching-programs/7868EAF1CA38B7027E301E850E7D3328

On the structure of log-space probabilistic complexity classes: Extended abstract

Autoři: Ioan I. Macarie

Zdroj: Lecture Notes in Computer Science ISBN: 9783540590422

Témata: probabilistic Turing machines, heads hierarchy, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), 15. Life on land, 16. Peace & justice, 01 natural sciences, 7. Clean energy, 12. Responsible consumption, Discrete mathematics in relation to computer science, logspace reductions, multihead finite automata, games against nature, 11. Sustainability, probabilistic computation, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), 14. Life underwater, Parallel algorithms in computer science, Arthur-Merlin games

Popis souboru: application/xml

Přístupová URL adresa: https://locus.siam.org/doi/abs/10.1137/S0097539796298339
https://epubs.siam.org/doi/pdf/10.1137/S0097539796298339
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp29.html#Macarie99
https://link.springer.com/chapter/10.1007/3-540-59042-0_107
https://rd.springer.com/chapter/10.1007/3-540-59042-0_107
https://dblp.uni-trier.de/db/conf/stacs/stacs95.html#Macarie95

Circuit definitions of nondeterministic complexity classes

Autoři: H. Venkateswaran

Zdroj: Lecture Notes in Computer Science ISBN: 9783540505174

Témata: nondeterministic space and time classes, 4. Education, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), skew circuits, 16. Peace & justice, 01 natural sciences, arithmetic circuit, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), semi-unboundedness, Circuits, networks, Boolean circuits

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp21.html#Venkateswaran92
https://epubs.siam.org/doi/10.1137/0221040
https://link.springer.com/10.1007%2F3-540-50517-2_80
https://link.springer.com/chapter/10.1007/3-540-50517-2_80
https://rd.springer.com/chapter/10.1007/3-540-50517-2_80
https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs88.html#Venkateswaran88

Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations

Autoři: Chen, Michael Pavan, A. Vinodchandran, N. V.

Témata: Massively Parallel Computation, AMPC, Complexity Classes, LogSpace, NL, PSPACE, Data processing Computer science, InProceedings, publishedVersion

URL: https://drops.dagstuhl.de/opus/volltexte/2023/19163/

Fine Separation of Average-Time Complexity Classes: Fine separation of average-time complexity classes

Autoři: Jin-Yi Cai Alan L. Selman

Zdroj: Lecture Notes in Computer Science ISBN: 9783540609223

Témata: computational complexity, average-P, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), average-time complexity classes, hierarchy, 0102 computer and information sciences, 02 engineering and technology, logarithmico-exponential functions, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://rd.springer.com/chapter/10.1007/3-540-60922-9_28
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp28.html#CaiS99
https://epubs.siam.org/doi/pdf/10.1137/S0097539796311715
https://link.springer.com/chapter/10.1007%2F3-540-60922-9_28
https://link.springer.com/10.1007%2F3-540-60922-9_28
https://dblp.uni-trier.de/db/conf/stacs/stacs96.html#CaiS96

Nondeterministic Quantum Query and Communication Complexities: Nondeterministic quantum query and communication complexities

Autoři: Ronald de Wolf

Zdroj: SIAM Journal on Computing. 32:681-699

Témata: nondeterminism, Quantum computation, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), query complexity, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), communication complexity, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), 01 natural sciences, quantum computing

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/pdf/cs/0001014v3.pdf
https://epubs.siam.org/doi/10.1137/S0097539702407345
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp32.html#Wolf03
https://locus.siam.org/doi/abs/10.1137/S0097539702407345

Complexity classes in models of cellular computing with membranes

Autoři: Mario J. Péerez Jiménez Álvaro Romero Jiménez Fernando Sancho Caparrini

Zdroj: Natural Computing. 2:265-285

Témata: membrane computing, P systems, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, complexity classes

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1993163

On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games

Autoři: Maciej Liśkiewicz Rüdiger Reischuk

Zdroj: Computational Complexity. 8:273-307

Témata: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), stochastic Turing machine, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1545261
https://doi.org/10.1007/s000370050031
https://dblp.uni-trier.de/db/journals/cc/cc8.html#LiskiewiczR99
https://link.springer.com/article/10.1007/s000370050031

Simultaneous strong separations of probabilistic and unambiguous complexity classes

Autoři: James Tisdall Bülent Yener Lane A. Hemachandra a další

Zdroj: Mathematical Systems Theory. 25:23-36

Témata: probabilistic computation, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), relativized world, 01 natural sciences, unambiguous computation

Popis souboru: application/xml

Přístupová URL adresa: http://www.ics.uci.edu/~eppstein/pubs/EppHemTis-MST-92.pdf
https://zbmath.org/38895
https://doi.org/10.1007/bf01368782
https://dblp.uni-trier.de/db/journals/mst/mst25.html#EppsteinHTY92
https://www.ics.uci.edu/~eppstein/pubs/EppHemTis-MST-92.pdf
https://link.springer.com/article/10.1007/BF01368782
https://link.springer.com/content/pdf/10.1007/BF01368782.pdf
https://urresearch.rochester.edu/institutionalPublicationPublicView.action?institutionalItemId=4770

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication: Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication

Autoři: Beate Bollig

Zdroj: Lecture Notes in Computer Science ISBN: 9783540679011

Témata: Switching theory, application of Boolean algebra, Boolean functions, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), branching programs, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: http://eccc.hpi-web.de/report/2000/048/download/
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2000.html#Bollig00
https://link.springer.com/chapter/10.1007%2F3-540-44612-5_18
https://link.springer.com/10.1007/3-540-44612-5_18
http://eccc.hpi-web.de/report/2000/048/download/
https://core.ac.uk/display/102553684
https://rd.springer.com/chapter/10.1007/3-540-44612-5_18
https://www.cambridge.org/core/journals/rairo-theoretical-informatics-and-applications/article/restricted-nondeterministic-readonce-branching-programs-and-an-exponential-lower-bound-for-integer-multiplication/6314383C4295322F6A8CC9BC92110702
https://www.rairo-ita.org/articles/ita/abs/2001/02/ita0012/ita0012.html
https://dblp.uni-trier.de/db/journals/ita/ita35.html#Bollig01
http://www.rairo-ita.org/articles/ita/abs/2001/02/ita0012/ita0012.html

Monadic logical definability of nondeterministic linear time

Autoři: Grandjean, Etienne Olive, Frédéric System, HAL a další

Přispěvatelé: Grandjean, Etienne Olive, Frédéric System, HAL a další

Zdroj: computational complexity. 7:54-97

Témata: descriptive complexity theory, nondeterminism, Complexity of computation (including implicit computational complexity), computational complexity, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], monadic second-order logic, Model theory of finite structures, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], unary functions, 0102 computer and information sciences, Interpolation, preservation, definability, 16. Peace & justice, 01 natural sciences, finite model theory, linear time, random access machine, NP-complete problem, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Higher-order logic, type theory

Popis souboru: application/xml

Přístupová URL adresa: https://hal.science/hal-00255036v1
https://link.springer.com/10.1007/PL00001594
https://dblp.uni-trier.de/db/journals/cc/cc7.html#GrandjeanO98
https://link.springer.com/article/10.1007%2FPL00001594

A Step towards a Complexity Theory for Analog Systems: A step towards a complexity theory for analog systems

Autoři: GORI M. MEER K. Gori, M. a další

Přispěvatelé: GORI M. MEER K. Gori, M. a další

Zdroj: Gori, M & Meer, K 2002, ' A step towards a complexity theory for analog systems ', Mathematical Logic Quarterly, vol. 48, suppl, no. 1, pp. 45-58 . https://doi.org/10.1002/1521-3870(200210)48:1+<45::aid-malq45>3.0.co;2-7

Témata: dynamical systems, analog computations, complexity, optimization, analog computation, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Models of computation (Turing machines, etc.), Applications of dynamical systems, dynamical system, energy functions

Popis souboru: application/xml; STAMPA

Přístupová URL adresa: https://zbmath.org/1850714
https://doi.org/10.1002/1521-3870(200210)48:1+<45::aid-malq45>3.0.co;2-7
https://dblp.uni-trier.de/db/journals/mlq/mlq48.html#GoriM02
https://dialnet.unirioja.es/servlet/articulo?codigo=2805307
https://philpapers.org/rec/MEEAST
https://portal.findresearcher.sdu.dk/da/publications/e55f0fc0-ba98-11dc-9626-000ea68e967b

The Communication Hierarchy of Time and Space Bounded Parallel Machines: The communication hierarchy of time and space bounded parallel machines

Autoři: Norbert Popély

Zdroj: RAIRO - Theoretical Informatics and Applications. 37:159-176

Témata: Complexity of computation (including implicit computational complexity), communicating alternating machines, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Hierarchies of computability and definability, synchronized alternating machines

Popis souboru: application/xml

Přístupová URL adresa: http://www.numdam.org/item/10.1051/ita:2003012.pdf
https://zbmath.org/2111672
https://doi.org/10.1051/ita:2003012

Parallel Quantum Computation and Quantum Codes: Parallel quantum computation and quantum codes

Autoři: Martin Nilsson Cristopher Moore

Zdroj: SIAM Journal on Computing. 31:799-815

Témata: Quantum Physics, group theory, FOS: Physical sciences, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 01 natural sciences, quantum error-correcting codes, quantum complexity classes, Quantum computation, Mathematics - Quantum Algebra, 0103 physical sciences, FOS: Mathematics, Complexity classes (hierarchies, relations among complexity classes, etc.), Quantum Algebra (math.QA), quantum circuits, parallel computation, Quantum Physics (quant-ph)

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/pdf/quant-ph/9808027
http://arxiv.org/abs/quant-ph/9808027
https://zbmath.org/1732369
https://doi.org/10.1137/s0097539799355053
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#MooreN01
https://inspirehep.net/literature/474989
https://epubs.siam.org/doi/10.1137/S0097539799355053
https://doi.org/10.1137/S0097539799355053

Interactive proof systems and alternating time—space complexity: Interactive proof systems and alternating time-space complexity

Autoři: Carsten Lund Lance Fortnow

Zdroj: Lecture Notes in Computer Science ISBN: 3540537090

Témata: nondeterministic computation, public- coin interactive proof system, public-coin polynomial- space exponential-time verifiers, Analysis of algorithms and problem complexity, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, Models of computation (Turing machines, etc.), 01 natural sciences, alternating time-space complexity, Theoretical Computer Science, polynomial-time public-coin verifier, Complexity classes (hierarchies, relations among complexity classes, etc.), log-space polynomial-time public-coin verifier, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://rd.springer.com/chapter/10.1007/BFb0020804
https://doi.org/10.1016/0304-3975(93)90210-K
https://link.springer.com/chapter/10.1007/BFb0020804
https://dblp.uni-trier.de/db/conf/stacs/stacs91.html#FortnowL91
http://www.sciencedirect.com/science/article/pii/030439759390210K
https://www.sciencedirect.com/science/article/pii/030439759390210K

On the Complexity of Quantifier Elimination: the Structural Approach: On the complexity of quantifier elimination: The structural approach

Autoři: Felipe Cucker

Zdroj: The Computer Journal. 36:400-408

Témata: complexity of quantifier elimination, Analysis of algorithms and problem complexity, polynomial hierarchy over the reals, Quantifier elimination, model completeness, and related topics, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, Symbolic computation and algebraic computation, model for parallel computations, 01 natural sciences, computations with real numbers

Popis souboru: application/xml

Přístupová URL adresa: https://academic.oup.com/comjnl/article/36/5/400/392343
https://dblp.uni-trier.de/db/journals/cj/cj36.html#Cucker93

Separations by random oracles and 'Almost' classes for generalized reducibilities: Extended abstract

Autoři: Yongge Wang Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540602460

Témata: Complexity of computation (including implicit computational complexity), measurable classes of sets, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), resource-bounded reducibilities, random oracles, almost classes, generalized reducibilities, 16. Peace & justice, Abstract and axiomatic computability and recursion theory

Popis souboru: application/xml

Přístupová URL adresa: https://dialnet.unirioja.es/servlet/articulo?codigo=2805273
https://dblp.uni-trier.de/db/journals/mlq/mlq47.html#MerkleW01
https://link.springer.com/chapter/10.1007%2F3-540-60246-1_124
https://dblp.uni-trier.de/db/conf/mfcs/mfcs95.html#MerkleW95
https://philpapers.org/rec/WANSBR
https://math.uni-heidelberg.de/logic/merkle/final-versions/MLQ-almost.pdf
https://rd.springer.com/chapter/10.1007/3-540-60246-1_124

Lower Bounds in a Parallel Model without Bit Operations: Lower bounds in a parallel model without bit operations

Autoři: MULMULEY, K

Zdroj: SIAM Journal on Computing. 28:1460-1509

Témata: Lower Bounds, Maximum-Flow Problem, Computational Complexity, computational complexity, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, parallel algorithms, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Complexity, 02 engineering and technology, Algorithm, lower bounds, Parallel Algorithms, Complexity classes (hierarchies, relations among complexity classes, etc.), Parallel algorithms in computer science

Popis souboru: application/xml