„approximate degree.“

Suchergebnisse

1.000+ Treffer

• Growing degree hours - a simple, accurate, and precise protocol to approximate growing heat summation for grapevines
  Gu, S.
• Approximate multi-degree reduction of Q-Bézier curves via generalized Bernstein polynomial functions
  Hu, Xianzhi ; Hu, Gang ; Abbas, Muhammad ; Md Yushalify Misro
• Current control of a PWM power amplifier by an approximate 2-degree-of-freedom digital controller
  Fujita, Keisuke ; Higuchi, Kohji ; Nakano, Kazushi ; Matsushita, Koji ; Kajikawa, Tatsuyoshi ; Chino, Fumiho
• Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem
  Campêlo, Manoel ; Matias, Jhonata A. S.
• An Approximate Method for Non-Proportionally Damped Systems with Many Degrees of Freedom
  Qin, Jinqi ; Tang, Jiashi ; Zhang, Liang
• On the finite approximate controllability for Hilfer fractional evolution systems with nonlocal conditions
  Liu, Xianghu
• #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region
  Cai, Jin-Yi ; Galanis, Andreas ; Goldberg, Leslie Ann ; Guo, Heng ; Jerrum, Mark ; Stefankovic, Daniel ; Vigoda, Eric 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Degree Composition for Recursive Functions
  Chakraborty, Sourav ; Kayal, Chandrima ; Mittal, Rajat ; Paraashar, Manaswi ; Saurabh, Nitin 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parity vs. AC0 with Simple Quantum Preprocessing
  Slote, Joseph 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Composition of Randomized Query Complexity and Approximate Degree
  Chakraborty, Sourav ; Kayal, Chandrima ; Mittal, Rajat ; Paraashar, Manaswi ; Sanyal, Swagato ; Saurabh, Nitin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Degree Lower Bounds for Oracle Identification Problems
  Bun, Mark ; Voronova, Nadezhda 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
  Amanatidis, Georgios ; Kleer, Pieter 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph
  Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David ; Rawitz, Dror 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Approximate Degree of Bipartite Perfect Matching
  Beniamini, Gal 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast Mixing via Polymers for Random Graphs with Unbounded Degree
  Galanis, Andreas ; Goldberg, Leslie Ann ; Stewart, James 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
  Davies, Ewan ; Perkins, Will 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead
  Chakraborty, Sourav ; Chattopadhyay, Arkadev ; Mande, Nikhil S. ; Paraashar, Manaswi 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximate Degree Bounds for k-Distinctness
  Mande, Nikhil S. ; Thaler, Justin ; Zhu, Shuchen 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Bounds on Fourier Entropy and Min-Entropy
  Arunachalam, Srinivasan ; Chakraborty, Sourav ; Koucký, Michal ; Saurabh, Nitin ; de Wolf, Ronald 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Degree, Secret Sharing, and Concentration Phenomena
  Bogdanov, Andrej ; Mande, Nikhil S. ; Thaler, Justin ; Williamson, Christopher 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik