Thematische Bibliographien / Algebraic Circuits

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Algebraic Circuits“

Autor: Grafiati
Veröffentlicht am 11. Januar 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Algebraic Circuits" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Algebraic Circuits"

1

Limaye, Nutan, Srikanth Srinivasan, and Sébastien Tavenas. "Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits." Communications of the ACM 67, no. 2 (2024): 101–8. http://dx.doi.org/10.1145/3611094.

Der volle Inhalt der Quelle
Annotation:
An Algebraic Circuit for a multivariate polynomial P is a computational model for constructing the polynomial P using only additions and multiplications. It is a syntactic model of computation, as opposed to the Boolean Circuit model, and hence lower bounds for this model are widely expected to be easier to prove than lower bounds for Boolean circuits. Despite this, we do not have superpolynomial lower bounds against general algebraic circuits of depth 3 (except over constant-sized finite fields) and depth 4 (over any field other than F 2 ), while constant-depth Boolean circuit lower bounds ha
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Sopena, Alejandro, Max Hunter Gordon, Diego García-Martín, Germán Sierra, and Esperanza López. "Algebraic Bethe Circuits." Quantum 6 (September 8, 2022): 796. http://dx.doi.org/10.22331/q-2022-09-08-796.

Der volle Inhalt der Quelle
Annotation:
The Algebraic Bethe Ansatz (ABA) is a highly successful analytical method used to exactly solve several physical models in both statistical mechanics and condensed-matter physics. Here we bring the ABA into unitary form, for its direct implementation on a quantum computer. This is achieved by distilling the non-unitary R matrices that make up the ABA into unitaries using the QR decomposition. Our algorithm is deterministic and works for both real and complex roots of the Bethe equations. We illustrate our method on the spin-12 XX and XXZ models. We show that using this approach one can efficie
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Sarangapani, P., T. Thiessen, and W. Mathis. "Differential Algebraic Equations of MOS Circuits and Jump Behavior." Advances in Radio Science 10 (October 2, 2012): 327–32. http://dx.doi.org/10.5194/ars-10-327-2012.

Der volle Inhalt der Quelle
Annotation:
Abstract. Many nonlinear electronic circuits showing fast switching behavior exhibit jump effects which occurs when the state space of the electronic system contains a fold. This leads to difficulties during the simulation of these systems with standard circuit simulators. A method to overcome these problems is by regularization, where parasitic inductors and capacitors are added at the suitable locations. However, the transient solution will not be reliable if this regularization is not done in accordance with Tikhonov's Theorem. A geometric approach is taken to overcome these problems by exp
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

DUMITRIU, LUCIA, and MIHAI IORDACHE. "NUMERICAL STEADY-STATE ANALYSIS OF NONLINEAR ANALOG CIRCUITS DRIVEN BY MULTITONE SIGNALS." International Journal of Bifurcation and Chaos 17, no. 10 (2007): 3595–601. http://dx.doi.org/10.1142/s0218127407019421.

Der volle Inhalt der Quelle
Annotation:
Widely-separated time scales appear in many electronic circuits, making traditional analysis difficult, even impossible, if the circuits are highly nonlinear. This paper presents a new version of the modified nodal method in two time variables for the analysis of the circuit with widely separated time scales. By applying this approach the differential algebraic equations (DAE) describing the nonlinear analog circuits driven by multitone signals are transformed into multitime partial differential equations (MPDEs). In order to solve MPDEs, associated resistive discrete equivalent circuits (comp
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Saima Yasin. "Analysis of Reachable and Positive Electrical Circuits Modelled by differential Algebraic System." Mathematical Sciences and Applications 3, no. 1 (2024): 1–17. http://dx.doi.org/10.52700/msa.v3i1.23.

Der volle Inhalt der Quelle
Annotation:
This research paper undertakes an exploration of novel concepts within the domain of electrical circuits modeled by matrices. The study is centered around circuits encompassing elements such as resistances, coils, and voltage sources, with a specific focus on elucidating aspects of positivity and reachability. A distinctive approach is employed through the introduction of additional inductors, aimed at enhancing the circuit’s functionality. Employing mathematical analysis, this research endeavor advances an extensive comprehension of these circuits, shedding light on their behavior even when s
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Agrawal, Manindra, Sumanta Ghosh, and Nitin Saxena. "Bootstrapping variables in algebraic circuits." Proceedings of the National Academy of Sciences 116, no. 17 (2019): 8107–18. http://dx.doi.org/10.1073/pnas.1901272116.

Der volle Inhalt der Quelle
Annotation:
We show that for the blackbox polynomial identity testing (PIT) problem it suffices to study circuits that depend only on the first extremely few variables. One needs only to consider size-s degree-s circuits that depend on the firstlog○c svariables (where c is a constant and composes a logarithm with itself c times). Thus, the hitting-set generator (hsg) manifests a bootstrapping behavior—a partial hsg against very few variables can be efficiently grown to a complete hsg. A Boolean analog, or a pseudorandom generator property of this type, is unheard of. Our idea is to use the partial hsg and
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Ozawa, Kazuhiro, Kaoru Hirota, LászlóT Kóczy, and Ken Ōmori. "Algebraic fuzzy flip-flop circuits." Fuzzy Sets and Systems 39, no. 2 (1991): 215–26. http://dx.doi.org/10.1016/0165-0114(91)90214-b.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Tykhovod, Sergii, and Ihor Orlovskyi. "Development and Research of Method in the Calculation of Transients in Electrical Circuits Based on Polynomials." Energies 15, no. 22 (2022): 8550. http://dx.doi.org/10.3390/en15228550.

Der volle Inhalt der Quelle
Annotation:
Long electromagnetic transients occur in electrical systems because of switching and impulse actions As a result, the simulation time of such processes can be long, which is undesirable. Simulation time is significantly increased if the circuit in the study is complex, and also if this circuit is described by a rigid system of state equations. Modern requests of design engineers require an increase in the speed of calculations for realizing a real-time simulation. This work is devoted to the development of a unified spectral method for calculating electromagnetic transients in electrical circu
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Siegal-Gaskins, Dan, Elisa Franco, Tiffany Zhou, and Richard M. Murray. "An analytical approach to bistable biological circuit discrimination using real algebraic geometry." Journal of The Royal Society Interface 12, no. 108 (2015): 20150288. http://dx.doi.org/10.1098/rsif.2015.0288.

Der volle Inhalt der Quelle
Annotation:
Biomolecular circuits with two distinct and stable steady states have been identified as essential components in a wide range of biological networks, with a variety of mechanisms and topologies giving rise to their important bistable property. Understanding the differences between circuit implementations is an important question, particularly for the synthetic biologist faced with determining which bistable circuit design out of many is best for their specific application. In this work we explore the applicability of Sturm's theorem—a tool from nineteenth-century real algebraic geometry—to com
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Erata, Ferhat, Chuanqi Xu, Ruzica Piskac, and Jakub Szefer. "Quantum Circuit Reconstruction from Power Side-Channel Attacks on Quantum Computer Controllers." IACR Transactions on Cryptographic Hardware and Embedded Systems 2024, no. 2 (2024): 735–68. http://dx.doi.org/10.46586/tches.v2024.i2.735-768.

Der volle Inhalt der Quelle
Annotation:
The interest in quantum computing has grown rapidly in recent years, and with it grows the importance of securing quantum circuits. A novel type of threat to quantum circuits that dedicated attackers could launch are power trace attacks. To address this threat, this paper presents first formalization and demonstration of using power traces to unlock and steal quantum circuit secrets. With access to power traces, attackers can recover information about the control pulses sent to quantum computers. From the control pulses, the gate level description of the circuits, and eventually the secret alg
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema "Algebraic Circuits"

1

König, Daniel [Verfasser]. "Parallel evaluation of algebraic circuits / Daniel König." Siegen : Universitätsbibliothek der Universität Siegen, 2017. http://d-nb.info/1138836931/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Pade, Jonas. "Analysis and waveform relaxation for a differential-algebraic electrical circuit model." Doctoral thesis, Humboldt-Universität zu Berlin, 2021. http://dx.doi.org/10.18452/23044.

Der volle Inhalt der Quelle
Annotation:
Die Hauptthemen dieser Arbeit sind einerseits eine tiefgehende Analyse von nichtlinearen differential-algebraischen Gleichungen (DAEs) vom Index 2, die aus der modifizierten Knotenanalyse (MNA) von elektrischen Schaltkreisen hervorgehen, und andererseits die Entwicklung von Konvergenzkriterien für Waveform Relaxationsmethoden zum Lösen gekoppelter Probleme. Ein Schwerpunkt in beiden genannten Themen ist die Beziehung zwischen der Topologie eines Schaltkreises und mathematischen Eigenschaften der zugehörigen DAE. Der Analyse-Teil umfasst eine detaillierte Beschreibung einer Normalform für S
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Tavenas, Sébastien. "Bornes inférieures et supérieures dans les circuits arithmétiques." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2014. http://tel.archives-ouvertes.fr/tel-01066752.

Der volle Inhalt der Quelle
Annotation:
La complexité arithmétique est l'étude des ressources nécessaires pour calcu- ler des polynômes en n'utilisant que des opérations arithmétiques. À la fin des années 70, Valiant a défini (de manière semblable à la complexité booléenne) des classes de polynômes. Les polynômes, ayant des circuits de taille polyno- miale, considérés faciles forment la classe VP. Les sommes exponentielles de ces derniers correpondent alors à la classe VNP. L'hypothèse de Valiant est la conjecture que VP ̸= VNP.Bien que cette conjecture soit encore grandement ouverture, cette dernière semble toutefois plus accessibl
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Jain, Divyanshu. "MVHAM an extension of the homotopy analysis method for improving convergence of the multivariate solution of nonlinear algebraic equations as typically encountered in analog circuits /." Cincinnati, Ohio : University of Cincinnati, 2007. http://www.ohiolink.edu/etd/view.cgi?acc%5Fnum=ucin1194974755.

Der volle Inhalt der Quelle
Annotation:
Thesis (M.S.)--University of Cincinnati, 2007.<br>Advisor: Harold W. Carter. Title from electronic thesis title page (viewed Feb. 18, 2008). Includes abstract. Keywords: Homotopy Analysis Method; Solution of Nonlinear Algebraic Equations; Convergence. Includes bibliographical references.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Lagarde, Guillaume. "Contributions to arithmetic complexity and compression." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC192/document.

Der volle Inhalt der Quelle
Annotation:
Cette thèse explore deux territoires distincts de l’informatique fondamentale : la complexité et la compression. Plus précisément, dans une première partie, nous étudions la puissance des circuits arithmétiques non commutatifs, qui calculent des polynômes non commutatifs en plusieurs indéterminées. Pour cela, nous introduisons plusieurs modèles de calcul, restreints dans leur manière de calculer les monômes. Ces modèles en généralisent d’autres, plus anciens et largement étudiés, comme les programmes à branchements. Les résultats sont de trois sortes. Premièrement, nous donnons des bornes infé
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Remscrim, Zachary (Zachary N. ). "Algebraic methods in pseudorandomness and circuit complexity." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/106089.

Der volle Inhalt der Quelle
Annotation:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 93-96).<br>In this thesis, we apply tools from algebra and algebraic geometry to prove new results concerning extractors for algebraic sets, AC⁰-pseudorandomness, the recursive Fourier sampling problem, and VC dimension. We present a new construction of an extractor which works for algebraic sets defined by polynomials over F₂ of substantially higher degree than the previous state-of-the-ar
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Ramponi, Marco. "Clifford index and gonality of curves on special K3 surfaces." Thesis, Poitiers, 2017. http://www.theses.fr/2017POIT2317/document.

Der volle Inhalt der Quelle
Annotation:
Nous allons étudier les propriétés des courbes algébriques sur des surfaces K3 spéciales, du point de vue de la théorie de Brill-Noether.La démonstration de Lazarsfeld du théorème de Gieseker-Petri a mis en lumière l'importance de la théorie de Brill-Noether des courbes admettant un plongement dans une surface K3. Nous allons donner une démonstration détaillée de ce résultat classique, inspirée par les idées de Pareschi. En suite, nous allons décrire le théorème de Green et Lazarsfeld, fondamental pour tout notre travail, qui établit le comportement de l'indice de Clifford des courbes sur les
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Reich, Sebastian. "Differential-algebraic equations and applications in circuit theory." Universität Potsdam, 1992. http://opus.kobv.de/ubp/volltexte/2010/4664/.

Der volle Inhalt der Quelle
Annotation:
Technical and physical systems, especially electronic circuits, are frequently modeled as a system of differential and nonlinear implicit equations. In the literature such systems of equations are called differentialalgebraic equations (DAEs). It turns out that the numerical and analytical properties of a DAE depend on an integer called the index of the problem. For example, the well-known BDF method of Gear can be applied, in general, to a DAE only if the index does not exceed one. In this paper we give a geometric interpretation of higherindex DAEs and indicate problems arising in connection
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Bächle, Simone. "Numerical solution of differential-algebraic systems arising in circuit simulation." [S.l.] : [s.n.], 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1524.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Grenet, Bruno. "Représentations des polynômes, algorithmes et bornes inférieures." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00770148.

Der volle Inhalt der Quelle
Annotation:
La complexité algorithmique est l'étude des ressources nécessaires -- le temps, la mémoire, ... -- pour résoudre un problème de manière algorithmique. Dans ce cadre, la théorie de la complexité algébrique est l'étude de la complexité algorithmique de problèmes de nature algébrique, concernant des polynômes.Dans cette thèse, nous étudions différents aspects de la complexité algébrique. D'une part, nous nous intéressons à l'expressivité des déterminants de matrices comme représentations des polynômes dans le modèle de complexité de Valiant. Nous montrons que les matrices symétriques ont la même
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Algebraic Circuits"

1

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, and Antonio García Ríos. Algebraic Circuits. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54649-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Krishnaswamy, Smita. Design, Analysis and Test of Logic Circuits Under Uncertainty. Springer Netherlands, 2013.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Barg, Alexander, and O. R. Musin. Discrete geometry and algebraic combinatorics. American Mathematical Society, 2014.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Tsfasman, M. A. Algebraic geometry codes: Basic notions. American Mathematical Society, 2007.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

International Conference Arithmetic, Geometry, Cryptography and Coding Theory (14th 2013 Marseille, France). Algorithmic arithmetic, geometry, and coding theory: 14th International Conference, Arithmetic, Geometry, Cryptography, and Coding Theory, June 3-7 2013, CIRM, Marseille, France. Edited by Ballet Stéphane 1971 editor, Perret, M. (Marc), 1963- editor, and Zaytsev, Alexey (Alexey I.), 1976- editor. American Mathematical Society, 2015.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Thornton, Mitchell Aaron. Spectral techniques in VLSI CAD. Kluwer Academic Publishers, 2001.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Alta.) WIN (Conference) (2nd 2011 Banff. Women in Numbers 2: Research directions in number theory : BIRS Workshop, WIN2 - Women in Numbers 2, November 6-11, 2011, Banff International Research Station, Banff, Alberta, Canada. Edited by David Chantal 1964-, Lalín Matilde 1977-, and Manes Michelle 1970-. American Mathematical Society, 2013.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Viamontes, George F. Quantum Circuit Simulation. Springer Science+Business Media B.V., 2009.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Stanković, Radomir S. From Boolean logic to switching circuits and automata: Towards modern information technology. Springer Verlag, 2011.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Algebraic Circuits"

1

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, and Antonio García Ríos. "Basic Algebraic Circuits." In Intelligent Systems Reference Library. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54649-5_4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Basic Algebraic Circuits." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Basic Arithmetic Circuits." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Galois Fields GF(pn)." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_11.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Multiplication." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Special Functions." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Number Systems." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Residue Number Systems." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Addition and Subtraction." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Lloris Ruiz, Antonio, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos, and María José Lloris Meseguer. "Two Galois Fields Cryptographic Applications." In Arithmetic and Algebraic Circuits. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67266-9_12.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Algebraic Circuits"

1

Andrews, Robert, and Avi Wigderson. "Constant-Depth Arithmetic Circuits for Linear Algebra Problems." In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2024. http://dx.doi.org/10.1109/focs61266.2024.00138.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Agrawal, Manindra, Sumanta Ghosh, and Nitin Saxena. "Bootstrapping variables in algebraic circuits." In STOC '18: Symposium on Theory of Computing. ACM, 2018. http://dx.doi.org/10.1145/3188745.3188762.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Man, Ka Lok, Abhinav Asthana, K. Kapoor Hemangee, Tomas Krilavicius, and Jian Chang. "Process algebraic specification of DI circuits." In 2010 International SoC Design Conference (ISOCC 2010). IEEE, 2010. http://dx.doi.org/10.1109/socdc.2010.5682885.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Ben-Asher, Yosi, and Gady Haber. "Efficient parallel solutions of linear algebraic circuits." In the eleventh annual ACM symposium. ACM Press, 1999. http://dx.doi.org/10.1145/305619.305644.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Rao, Vikas, Haden Ondricek, Priyank Kalla, and Florian Enescu. "Algebraic Techniques for Rectification of Finite Field Circuits." In 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC). IEEE, 2021. http://dx.doi.org/10.1109/vlsi-soc53125.2021.9606976.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Limaye, Nutan, Srikanth Srinivasan, and Sebastien Tavenas. "Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits." In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2022. http://dx.doi.org/10.1109/focs52979.2021.00083.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Dutta, Pranjal, Prateek Dwivedi, and Nitin Saxena. "Demystifying the border of depth-3 algebraic circuits." In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2022. http://dx.doi.org/10.1109/focs52979.2021.00018.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Calvino, Alessandro Tempia, and Giovanni De Micheli. "Algebraic and Boolean Methods for SFQ Superconducting Circuits." In 2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC). IEEE, 2024. http://dx.doi.org/10.1109/asp-dac58780.2024.10473899.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Grigoraş, Victor, and Carmen Grigoraş. "Nonlinear System with Adaptive Algebraic Function." In 2023 International Symposium on Signals, Circuits and Systems (ISSCS). IEEE, 2023. http://dx.doi.org/10.1109/isscs58449.2023.10190933.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Hiroaki Yoshida, Makoto Ikeda, and Kunihiro Asada. "An algebraic approach for transistor circuit synthesis." In 2005 12th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2005). IEEE, 2005. http://dx.doi.org/10.1109/icecs.2005.4633590.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Algebraic Circuits"

1

Barnett, Janet Heine. Applications of Boolean Algebra: Claude Shannon and Circuit Design. The MAA Mathematical Sciences Digital Library, 2013. http://dx.doi.org/10.4169/loci004000.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie