咨询与建议

限定检索结果

文献类型

  • 291 篇 期刊文献
  • 221 篇 会议
  • 111 册 图书
  • 21 篇 学位论文

馆藏范围

  • 640 篇 电子文献
  • 19 种 纸本馆藏

日期分布

学科分类号

  • 365 篇 理学
    • 340 篇 数学
    • 39 篇 物理学
    • 29 篇 统计学(可授理学、...
    • 7 篇 化学
    • 7 篇 生物学
    • 6 篇 系统科学
    • 2 篇 天文学
  • 250 篇 工学
    • 203 篇 计算机科学与技术...
    • 73 篇 软件工程
    • 28 篇 电气工程
    • 23 篇 信息与通信工程
    • 12 篇 控制科学与工程
    • 7 篇 电子科学与技术(可...
    • 6 篇 材料科学与工程(可...
    • 6 篇 化学工程与技术
    • 5 篇 机械工程
    • 5 篇 光学工程
    • 5 篇 仪器科学与技术
    • 4 篇 生物医学工程(可授...
    • 3 篇 力学(可授工学、理...
    • 3 篇 土木工程
    • 2 篇 生物工程
  • 16 篇 管理学
    • 9 篇 管理科学与工程(可...
    • 7 篇 图书情报与档案管...
  • 6 篇 医学
    • 4 篇 临床医学
    • 3 篇 基础医学(可授医学...
  • 5 篇 教育学
    • 4 篇 教育学
    • 4 篇 心理学(可授教育学...
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 3 篇 农学
  • 2 篇 哲学
    • 2 篇 哲学
  • 2 篇 法学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 112 篇 polynomials
  • 89 篇 algebra
  • 35 篇 number theory
  • 34 篇 matrix algebra
  • 31 篇 computer science
  • 22 篇 graph theory
  • 18 篇 linear algebra
  • 15 篇 mathematics
  • 15 篇 complexity theor...
  • 13 篇 algorithms
  • 12 篇 computer algebra
  • 10 篇 group theory
  • 10 篇 cryptography
  • 9 篇 combinatorics
  • 8 篇 computational ma...
  • 8 篇 application soft...
  • 8 篇 applications of ...
  • 8 篇 boolean algebra
  • 8 篇 educational inst...
  • 8 篇 group theory and...

机构

  • 5 篇 school of mathem...
  • 4 篇 pennsylvania sta...
  • 3 篇 department of co...
  • 3 篇 computer science...
  • 3 篇 massachusetts in...
  • 3 篇 univ bath dept c...
  • 3 篇 georgia inst tec...
  • 3 篇 mit dept math ca...
  • 2 篇 department of co...
  • 2 篇 univ minho cmat ...
  • 2 篇 research laborat...
  • 2 篇 univ bonn b it d...
  • 2 篇 military academy...
  • 2 篇 institute of com...
  • 2 篇 department of co...
  • 2 篇 tilburg univ dep...
  • 2 篇 department of ap...
  • 2 篇 univ chicago dep...
  • 2 篇 university of mi...
  • 2 篇 school of electr...

作者

  • 5 篇 ziegler konstant...
  • 4 篇 basu saugata
  • 4 篇 qiao youming
  • 4 篇 gary l. mullen
  • 3 篇 perret ludovic
  • 3 篇 tsigaridas elias
  • 3 篇 drineas petros
  • 3 篇 gathen joachim v...
  • 3 篇 avron haim
  • 3 篇 krivine jean
  • 3 篇 giesbrecht mark
  • 3 篇 colton simon
  • 3 篇 chowdhury agniva
  • 3 篇 grochow joshua a...
  • 3 篇 von zur gathen j...
  • 3 篇 faugere jean-cha...
  • 3 篇 behr nicolas
  • 3 篇 london palma
  • 2 篇 babai l
  • 2 篇 muggleton stephe...

语言

  • 535 篇 英文
  • 70 篇 其他
  • 39 篇 中文
检索条件"任意字段=Computer Algebra and Polynomials: Applications of Algebra and Number Theory"
644 条 记 录,以下是551-560 订阅
排序:
m-Hilbert Polynomial and Arbitrariness of the General Solution of Partial Differential Equations
m-Hilbert Polynomial and Arbitrariness of the General Soluti...
收藏 引用
International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
作者: Qi Ding Hongqing Zhang School of Mathematical Science Dalian University of Technology Dalian China
Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's ... 详细信息
来源: 评论
polynomials that sign represent parity and Descartes rule of signs
Polynomials that sign represent parity and Descartes rule of...
收藏 引用
Annual IEEE Conference on Computational Complexity
作者: S. Basu N. Bhatnagar P. Gopalan R.J. Lipton School of Mathematics Georgia Tech Research Institute Georgia Institute of Technology USA College of Computing Georgia Tech Research Institute Georgia Institute of Technology USA
We study the sparsity of real polynomials that sign represent parity on n variables, each of which takes values from some finite subset A of integers. While the degree of such polynomials has been well studied by M. M... 详细信息
来源: 评论
theory of supports for linear codes endowed with the sum-rank metric
arXiv
收藏 引用
arXiv 2018年
作者: Martínez-Peñas, Umberto Dept. of Electrical & Computer Engineering University of Toronto Canada
The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory over fields. It measures the error-correcting capability of codes in multishot matrix-multiplicative channels (e.g. linear netwo... 详细信息
来源: 评论
On the polynomial parity argument complexity of the Combinatorial Nullstellensatz
arXiv
收藏 引用
arXiv 2017年
作者: Belovs, Aleksandrs Ivanyos, Gábor Qiao, Youming Santha, Miklos Yang, Siyi Faculty of Computing University of Latvia Institute for Computer Science and Control Hungarian Academy of Sciences Budapest Hungary Centre for Quantum Computation and Intelligent Systems University of Technology Sydney Australia IRIF Université Paris Diderot CNRS Paris75205 France Centre for Quantum Technologies National University of Singapore MajuLab CNRS Singapore117543 Singapore Centre for Quantum Technologies National University of Singapore Singapore117543 Singapore
The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra an... 详细信息
来源: 评论
Efficient Unitary Designs from Random Sums and Permutations
Efficient Unitary Designs from Random Sums and Permutations
收藏 引用
Annual IEEE Symposium on Foundations of computer Science
作者: Chi-Fang Chen Jordan Docter Michelle Xu Adam Bouland Fernando G.S.L. Brandão Patrick Hayden Institute for Quantum Information and Matter California Institute of Technology Pasadena CA USA Department of Computer Science Stanford University Stanford CA USA Stanford Institute for Theoretical Physics Stanford University Stanford CA USA
A unitary k-design is an ensemble of unitaries that matches the first $k$ moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory tec... 详细信息
来源: 评论
Extremal Combinatorics  2
收藏 引用
丛书名: Texts in Theoretical computer Science. An EATCS Series
2011年
作者: Stasys Jukna
This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called... 详细信息
来源: 评论
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or
Intruder deductions, constraint solving and insecurity decis...
收藏 引用
Annual Symposium on Logic in computer Science
作者: H. Comon-Lundh V. Shmatikov LSV INRIA-ENS Cachan Cachan France SRI International Inc. Menlo Park CA USA
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect cryptography assumption is unrealistic ... 详细信息
来源: 评论
Finite Fields: theory, applications, and Algorithms
收藏 引用
1994年
作者: Gary L. Mullen Peter Jau-Shyong Shiue
Because of their applications in so many diverse areas, finite fields continue to play increasingly important roles in various branches of modern mathematics, including number theory, algebra, and algebraic geometry, ...
来源: 评论
SparseAuto: An Auto-Scheduler for Sparse Tensor Computations Using Recursive Loop Nest Restructuring
arXiv
收藏 引用
arXiv 2023年
作者: Dias, Adhitha Anderson, Logan Sundararajah, Kirshanthan Pelenitsyn, Artem Kulkarni, Milind Electrical and Computer Engineering Purdue University 610 Purdue Mall West LafayetteIN47906 United States Computer Science Virginia Tech BlacksburgVA24061 United States
Automated code generation and performance enhancements for sparse tensor algebra have become essential in many real-world applications, such as quantum computing, physical simulations, computational chemistry, and mac... 详细信息
来源: 评论
A formalization of set theory without variables
收藏 引用
丛书名: Colloquium Publications Amer Mathematical Soc
1987年
作者: Alfred Tarski and Steven Givant
Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the...
来源: 评论