-
1دورية أكاديمية
المصدر: Quantum, Vol 8, p 1387 (2024)
وصف الملف: electronic resource
-
2دورية أكاديمية
المؤلفون: Antonio Acín, Immanuel Bloch, Harry Buhrman, Tommaso Calarco, Christopher Eichler, Jens Eisert, Daniel Esteve, Nicolas Gisin, Steffen J Glaser, Fedor Jelezko, Stefan Kuhr, Maciej Lewenstein, Max F Riedel, Piet O Schmidt, Rob Thew, Andreas Wallraff, Ian Walmsley, Frank K Wilhelm
المصدر: New Journal of Physics, Vol 20, Iss 8, p 080201 (2018)
مصطلحات موضوعية: quantum theory, quantum coomputing, quantum simulation, quantum sensing, quantum communication, quantum technologies, Science, Physics, QC1-999
وصف الملف: electronic resource
Relation: https://doaj.org/toc/1367-2630
-
3دورية أكاديمية
المؤلفون: Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
المصدر: Logical Methods in Computer Science, Vol Volume 10, Issue 3 (2014)
مصطلحات موضوعية: computer science - computational complexity, computer science - logic in computer science, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95
وصف الملف: electronic resource
-
4
المؤلفون: Nikolay Vereshchagin, Harry Buhrman, Boaz Patt-Shamir, Michal Koucký, Matthias Christandl, Zvi Lotker
المساهمون: Logic and Computation (ILLC, FNWI/FGw)
المصدر: Algorithmica, 83, 667-694
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ISBN: 9783540742074
APPROX-RANDOM
Buhrman, H, Christandl, M, Koucky, M, Lotker, Z, Patt-Shamir, B & Vereshchagin, N 2021, ' High Entropy Random Selection Protocols ', Algorithmica, vol. 83, no. 2, pp. 667-694 . https://doi.org/10.1007/s00453-020-00770-y
ResearcherID
APPROX-RANDOM, 366-379
STARTPAGE=366;ENDPAGE=379;TITLE=APPROX-RANDOMمصطلحات موضوعية: General Computer Science, 02 engineering and technology, 0102 computer and information sciences, Data_CODINGANDINFORMATIONTHEORY, 01 natural sciences, Combinatorics, 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Networking and Internet Architecture, Entropy (information theory), Analytic number theory, 0101 mathematics, Binary strings, Randomness, Mathematics, Computer Science::Cryptography and Security, Discrete mathematics, Conjecture, Applied Mathematics, Random string, 010102 general mathematics, Shannon entropy, Min entropy, TheoryofComputation_GENERAL, KAKEYA SETS, Binary logarithm, Computer Science Applications, Number theory, Random string ds, 010201 computation theory & mathematics, Theory of computation, 020201 artificial intelligence & image processing, Security parameter
وصف الملف: application/pdf
-
5
المؤلفون: Nikolay Vereshchagin, Leen Torenvliet, Harry Buhrman, Falk Unger
المساهمون: Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands
المصدر: Algorithmica, 81, 179-200
مصطلحات موضوعية: Discrete mathematics, Polynomial, Class (set theory), General Computer Science, Computational complexity theory, Applied Mathematics, Construct (python library), Oracle, Computer Science Applications, Set (abstract data type), Computational complexity, Selfreducibility, Sparseness, Theory of computation, Time complexity, Mathematics
-
6
المؤلفون: Florian Speelman, Michal Koucky, Joshua Brody, Harry Buhrman, Bruno Loff, Nikolay Vereshchagin
المساهمون: ILLC (FNWI), Logic and Computation (ILLC, FNWI/FGw), Quantum Matter and Quantum Information, Algorithms and Complexity
المصدر: IEEE Conference on Computational Complexity
Algorithmica, 76(3), 749-781. Springer New York
CCC 2013 : 2013 IEEE Conference on Computational Complexity: proceedings : 5-7 June 2013, Palo Alto, California, USA, 24-33
STARTPAGE=24;ENDPAGE=33;TITLE=CCC 2013 : 2013 IEEE Conference on Computational Complexity
Algorithmica, 76(3), 749-781
Brody, J E, Buhrman, H, Koucký, M, Loff, B & Speelman, F 2016, ' Towards a Reverse Newman's Theorem in Interactive Information Complexity ', Algorithmica, vol. 76, no. 3, pp. 749-781 . https://doi.org/10.1007/s00453-015-0112-9مصطلحات موضوعية: 0209 industrial biotechnology, Theoretical computer science, General Computer Science, Computer science, interactive communication compression, Context (language use), 0102 computer and information sciences, 02 engineering and technology, Information theory, 01 natural sciences, Structural complexity theory, 020901 industrial engineering & automation, 0202 electrical engineering, electronic engineering, information engineering, communication complexity, Communication complexity, Randomness, Generality, Applied Mathematics, 020206 networking & telecommunications, interactive information complexity, Computer Science Applications, 010201 computation theory & mathematics, Bounded function, Theory of computation, 020201 artificial intelligence & image processing, Communications protocol, Computer Science(all)
وصف الملف: application/pdf
-
7
المؤلفون: Florian Speelman, Andrzej Grudka, Paweł Horodecki, Łukasz Czekaj, Harry Buhrman, Marcin Markiewicz, Michał Horodecki, Sergii Strelchuk
المساهمون: Strelchuk, Sergii [0000-0001-8390-3034], Apollo - University of Cambridge Repository, ILLC (FNWI), Quantum Matter and Quantum Information, Logic and Computation (ILLC, FNWI/FGw)
المصدر: Proceedings of the National Academy of Sciences of the United States of America, 113(12), 3191-3196
Proceedings of the National Academy of Sciences of the United States of America, 113(12), 3191-3196. National Academy of Sciencesمصطلحات موضوعية: nonlocality, FOS: Physical sciences, Topology, computer.software_genre, 01 natural sciences, Teleportation, 010305 fluids & plasmas, quantum, Quantum nonlocality, 0103 physical sciences, communication complexity, 010306 general physics, Communication complexity, Quantum information science, Quantum, Mathematics, Quantum Physics, Multidisciplinary, port-based teleportation, Bell inequality, Arbitrarily large, Bell's theorem, Data mining, Quantum Physics (quant-ph), computer, Value (mathematics)
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d7cb6f1e6dbc2359fc59d1b08d3665d
https://doi.org/10.1073/pnas.1507647113 -
8
المؤلفون: Harry Buhrman, Monique Laurent, Giannicola Scarpa, Jop Briët, Teresa Piovesan
المساهمون: Algorithms and Complexity, Networks and Optimization, ILLC (FNWI), Logic and Computation (ILLC, FNWI/FGw), Quantum Matter and Quantum Information, Econometrics and Operations Research, Research Group: Operations Research
المصدر: IEEE Transactions on Information Theory, 61(2), 1124-1138
IEEE Transactions on Information Theory, 61(2), 1124-1138. Institute of Electrical and Electronics Engineers Inc.مصطلحات موضوعية: Discrete mathematics, Quantum Physics, Source code, media_common.quotation_subject, FOS: Physical sciences, Data_CODINGANDINFORMATIONTHEORY, Quantum entanglement, Library and Information Sciences, Upper and lower bounds, Computer Science Applications, Channel capacity, Alice and Bob, Hadamard transform, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Quantum Physics (quant-ph), Computer Science::Information Theory, Information Systems, media_common, Mathematics, Coding (social sciences), Zero error
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ff87faafdaa5ae2305f742c5154f55d
https://doi.org/10.1109/tit.2014.2385080
-
9
المؤلفون: Bruno Loff, Leen Torenvliet, Harry Buhrman
المساهمون: Algorithms and Complexity, ILLC (FNWI), Quantum Matter and Quantum Information, Logic and Computation (ILLC, FNWI/FGw)
المصدر: Theory of Computing Systems, 56(2), 372-393
Theory of Computing Systems
Theory of Computing Systems, 56(2), 372-393. Springer New Yorkمصطلحات موضوعية: Discrete mathematics, Exponential time hypothesis, Computational complexity theory, Continuous knapsack problem, Hardness of approximation, Polynomial-time approximation scheme, Theoretical Computer Science, Computational Theory and Mathematics, Knapsack problem, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Theory of computation, Subset sum problem, Computer Science::Data Structures and Algorithms, Mathematics
وصف الملف: application/pdf
-
10
المؤلفون: Harry Buhrman, Jeroen Zuiddam, Matthias Christandl, Chris T. Perry
المساهمون: ILLC (FNWI), Quantum Matter and Quantum Information, Logic and Computation (ILLC, FNWI/FGw)
المصدر: Physical Review Letters, 117(230503), 230503-1-230503-5
Physical Review Letters, 117(23):230503. American Physical Societyمصطلحات موضوعية: Quantum Physics, Computer science, General Physics and Astronomy, FOS: Physical sciences, Quantum entanglement, Function (mathematics), Topology, Controlled NOT gate, Qubit, Boolean function, Quantum information science, Communications protocol, Communication complexity, Quantum Physics (quant-ph)
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14c40665584e00d1599a3264a0fd6480
https://doi.org/10.1103/physrevlett.117.230503
Full Text Finder 
Find this article in full text from Springer Verlag.