:: Library Catalog

Ata uhi

I tiakina i:

Ngā taipitopito rārangi puna kōrero
Ngā kaituhi matua:	Arvind, V., Joglekar, Pushkar S.
Hōputu:	Preprint
I whakaputaina:	2022
Ngā marau:	Computational Complexity
Urunga tuihono:	https://arxiv.org/abs/2202.09883
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!

Ngā tūemi rite

A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results
mā: Arvind, Vikraman, me ētahi atu.
I whakaputaina: (2024)

Trading Determinism for Noncommutativity in Edmonds' Problem
mā: Arvind, V., me ētahi atu.
I whakaputaina: (2024)

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
mā: Arvind, V., me ētahi atu.
I whakaputaina: (2023)

Some properties of Higman-Thompson monoids and digital circuits
mā: Birget, J. C.
I whakaputaina: (2024)

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
mā: Dutta, Pranjal, me ētahi atu.
I whakaputaina: (2024)

On Factorization of Sparse Polynomials of Bounded Individual Degree
mā: Chuyoon, Aminadav, me ētahi atu.
I whakaputaina: (2026)

A Quadratic Lower Bound for Noncommutative Circuits
mā: Shastri, Pratik
I whakaputaina: (2026)

Almost Polynomial Factor Inapproximability for Parameterized k-Clique
mā: S., Karthik C., me ētahi atu.
I whakaputaina: (2021)

Derandomizing Isolation In Catalytic Logspace
mā: Arvind, V., me ētahi atu.
I whakaputaina: (2025)

Efficient Polynomial Identity Testing Over Nonassociative Algebras
mā: Mukhopadhyay, Partha, me ētahi atu.
I whakaputaina: (2025)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
mā: Gibor, Daniel
I whakaputaina: (2025)

Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space
mā: Sajith, Thejas Radhika
I whakaputaina: (2025)

On a Hierarchy of Spectral Invariants for Graphs
mā: Arvind, V., me ētahi atu.
I whakaputaina: (2023)

A New Reduction Method from Multivariate Polynomials to Univariate Polynomials
mā: Wang, Cancan, me ētahi atu.
I whakaputaina: (2024)

Simple Norm Bounds for Polynomial Random Matrices via Decoupling
mā: Tulsiani, Madhur, me ētahi atu.
I whakaputaina: (2024)

On Matrix Multiplication and Polynomial Identity Testing
mā: Andrews, Robert
I whakaputaina: (2022)

Lifting with Inner Functions of Polynomial Discrepancy
mā: Manor, Yahel, me ētahi atu.
I whakaputaina: (2024)

Symmetric Algebraic Circuits and Homomorphism Polynomials
mā: Dawar, Anuj, me ētahi atu.
I whakaputaina: (2025)

On Boolean PCSPs with Polynomial Threshold Polymorphisms
mā: Michno, Katzper
I whakaputaina: (2025)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
mā: Jiang, Cheng, me ētahi atu.
I whakaputaina: (2026)

Attacking the Polynomials in the Maze of Finite Fields problem
mā: Barbero, Àngela, me ētahi atu.
I whakaputaina: (2026)

One-Way Functions and Polynomial Time Dimension
mā: Nandakumar, Satyadev, me ētahi atu.
I whakaputaina: (2024)

Computing the Elementary Symmetric Polynomials in Positive Characteristics
mā: Orzel, Ian
I whakaputaina: (2025)

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
mā: Kahanamoku-Meyer, Gregory D., me ētahi atu.
I whakaputaina: (2024)

Extractors for Polynomial Sources over $\mathbb{F}_2$
mā: Chattopadhyay, Eshan, me ētahi atu.
I whakaputaina: (2023)

Polynomial-Time PIT from (Almost) Necessary Assumptions
mā: Andrews, Robert, me ētahi atu.
I whakaputaina: (2025)

Revisiting Tree Canonization using polynomials
mā: Arvind, V., me ētahi atu.
I whakaputaina: (2024)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
mā: Vu, Thi Xuan
I whakaputaina: (2025)

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
mā: Chia, Nai-Hui, me ētahi atu.
I whakaputaina: (2024)

On the Characteristic Polynomial of Linearized Polynomials
mā: Bastioni, Luca, me ētahi atu.
I whakaputaina: (2025)

An Efficient Quantum Factoring Algorithm
mā: Regev, Oded
I whakaputaina: (2023)

Low-Degree Polynomials Are Good Extractors
mā: Alrabiah, Omar, me ētahi atu.
I whakaputaina: (2024)

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
mā: Komarath, Balagopal, me ētahi atu.
I whakaputaina: (2025)

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
mā: Cai, Jin-Yi, me ētahi atu.
I whakaputaina: (2024)

On the Expressibility of the Reconstructional Color Refinement
mā: Arvind, V., me ētahi atu.
I whakaputaina: (2024)

Positive Univariate Polynomials: SOS certificates, algorithms, bit complexity, and T-systems
mā: Bender, Matías, me ētahi atu.
I whakaputaina: (2025)

Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
mā: Raz, Ran
I whakaputaina: (2026)

A Near-Optimal Polynomial Distance Lemma Over Boolean Slices
mā: Amireddy, Prashanth, me ētahi atu.
I whakaputaina: (2025)

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
mā: Yao, Penghui, me ētahi atu.
I whakaputaina: (2025)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
mā: Przybyłek, Michał R., me ētahi atu.
I whakaputaina: (2026)