| Publication | Date of Publication | Type |
|---|
Multivariate to bivariate reduction for noncommutative polynomial factorization
| 2024-12-03 | Paper |
Multivariate to bivariate reduction for noncommutative polynomial factorization
Information and Computation | 2024-12-03 | Paper |
On identity testing and noncommutative rank computation over the free skew field
| 2024-09-25 | Paper |
Black-box identity testing of noncommutative rational formulas of inversion height two in deterministic quasipolynomial time
| 2024-08-22 | Paper |
On efficient noncommutative polynomial factorization via Higman linearization
| 2024-07-05 | Paper |
CNF satisfiability in a subspace and related problems
| 2024-02-12 | Paper |
A note on the self-witnessing property of computational problems
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Equivalence Testing of Weighted Automata over Partially Commutative Monoids
| 2023-08-08 | Paper |
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Efficient Black-Box Identity Testing for Free Group Algebras
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650271 (Why is no real title available?)
| 2023-02-03 | Paper |
Fast Exact Algorithms Using Hadamard Product of Polynomials
| 2023-02-03 | Paper |
CNF satisfiability in a subspace and related problems
Algorithmica | 2022-10-27 | Paper |
On the Weisfeiler-Leman dimension of fractional packing
Information and Computation | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7561312 (Why is no real title available?)
| 2022-07-21 | Paper |
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.
| 2022-07-18 | Paper |
Recognizing the Commuting Graph of a Finite Group
| 2022-06-02 | Paper |
Fast exact algorithms using Hadamard product of polynomials
Algorithmica | 2022-03-25 | Paper |
Univariate ideal membership parameterized by rank, degree, and number of generators
Theory of Computing Systems | 2022-02-14 | Paper |
Isomorphism testing of $k$-spanning tournaments is Fixed Parameter Tractable
| 2022-01-28 | Paper |
Parameterized complexity of small weight automorphisms and isomorphisms
Algorithmica | 2022-01-18 | Paper |
On explicit branching programs for the rectangular determinant and permanent polynomials
Chicago Journal of Theoretical Computer Science | 2021-05-14 | Paper |
On the Weisfeiler-Leman dimension of fractional packing
Language and Automata Theory and Applications | 2020-07-27 | Paper |
On Weisfeiler-Leman invariance: subgraph counts and related graph properties
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
| 2020-05-27 | Paper |
On Weisfeiler-Leman invariance: subgraph counts and related graph properties
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Reductions to sets of low information content (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
A quest for structure in complexity
| 2019-07-03 | Paper |
The Alon-Roichman theorem
| 2019-07-03 | Paper |
The Weisfeiler-Lehman procedure
| 2019-07-03 | Paper |
scientific article; zbMATH DE number 7075880 (Why is no real title available?)
| 2019-07-03 | Paper |
On the complexity of noncommutative polynomial factorization
Information and Computation | 2018-09-27 | Paper |
Expanding Generating Sets for Solvable Permutation Groups
SIAM Journal on Discrete Mathematics | 2018-07-20 | Paper |
Parameterized complexity of small weight automorphisms
| 2018-04-19 | Paper |
On the hardness of the noncommutative determinant
Computational Complexity | 2018-04-18 | Paper |
The parameterized complexity of fixing number and vertex individualization in graphs
| 2018-03-21 | Paper |
Solvable black-box group problems are low for \(\mathrm{PP}\)
STACS 96 | 2017-11-16 | Paper |
Graph isomorphism, color refinement, and compactness
Computational Complexity | 2017-10-18 | Paper |
Finding fixed point free elements and small bases in permutation groups
Theoretical Computer Science | 2017-06-13 | Paper |
Complexity theory basics: NP and NL
Perspectives in Computational Complexity | 2016-09-22 | Paper |
The parameterized complexity of geometric graph isomorphism
Algorithmica | 2016-09-07 | Paper |
Solving linear equations parameterized by Hamming weight
Algorithmica | 2016-09-07 | Paper |
Sparse sets, approximable sets, and parallel queries to NP
Information Processing Letters | 2016-06-16 | Paper |
Some lower bound results for set-multilinear arithmetic computations
Chicago Journal of Theoretical Computer Science | 2016-05-24 | Paper |
On the power of color refinement
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Solvable group isomorphism is (almost) in \(\mathsf{NP} \cap \mathsf{coNP}\)
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
On the complexity of noncommutative polynomial factorization
Lecture Notes in Computer Science | 2015-09-16 | Paper |
On Tinhofer's linear programming approach to isomorphism testing
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Solving linear equations parameterized by Hamming weight
Parameterized and Exact Computation | 2015-09-15 | Paper |
The parameterized complexity of geometric graph isomorphism
Parameterized and Exact Computation | 2015-09-15 | Paper |
Uniform derandomization from pathetic lower bounds
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
On the isomorphism problem for decision trees and decision lists
Theoretical Computer Science | 2015-06-10 | Paper |
Colored hypergraph isomorphism is fixed parameter tractable
Algorithmica | 2015-03-02 | Paper |
Isomorphism testing of Boolean functions computable by constant-depth circuits
Information and Computation | 2014-11-28 | Paper |
The complexity of bounded register and skew arithmetic computation
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Testing nilpotence of Galois groups in polynomial time
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The parameterized complexity of fixpoint free elements and bases in permutation groups
Parameterized and Exact Computation | 2013-12-10 | Paper |
The parallel complexity of graph canonization under abelian group action
Algorithmica | 2013-11-11 | Paper |
Comments on ``Arithmetic complexity, Kleene closure, and formal power series
Theory of Computing Systems | 2013-10-21 | Paper |
On the isomorphism problem for decision trees and decision lists
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Noncommutative arithmetic circuits meet finite automata
| 2013-01-28 | Paper |
Arithmetic circuits and the Hadamard product of polynomials
| 2012-10-24 | Paper |
Some sieving algorithms for lattice problems
| 2012-10-19 | Paper |
The isomorphism problem for \(k\)-trees is complete for logspace
Information and Computation | 2012-10-11 | Paper |
Near-optimal expanding generator sets for solvable permutation groups
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Approximate graph isomorphism
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Colored hypergraph isomorphism is fixed parameter tractable
| 2012-08-29 | Paper |
Erdős-Rényi sequences and deterministic construction of expanding Cayley graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Quantum query complexity of multilinear identity testing
| 2012-04-24 | Paper |
The remote point problem, small bias spaces, and expanding generator sets
| 2012-01-23 | Paper |
Canonizing hypergraphs under abelian group action
Lecture Notes in Computer Science | 2011-08-17 | Paper |
New results on noncommutative and commutative polynomial identity testing
Computational Complexity | 2011-02-18 | Paper |
The orbit problem is in the GapL hierarchy
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes
Computational Complexity | 2011-02-07 | Paper |
Uniform Derandomization from Pathetic Lower Bounds
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Isomorphism and canonization of tournaments and hypertournaments
Journal of Computer and System Sciences | 2010-08-18 | Paper |
The complexity of exactly learning algebraic concepts
Lecture Notes in Computer Science | 2010-04-27 | Paper |
The ideal membership problem and polynomial identity testing
Information and Computation | 2010-04-08 | Paper |
On Lower Bounds for Constant Width Arithmetic Circuits
Algorithms and Computation | 2009-12-17 | Paper |
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Parameterized learnability of juntas
Theoretical Computer Science | 2009-11-06 | Paper |
Arithmetic Circuits, Monomial Algebras and Finite Automata
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
scientific article; zbMATH DE number 5605063 (Why is no real title available?)
| 2009-09-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Non-stabilizer quantum codes from Abelian subgroups of the error group
| 2008-09-03 | Paper |
Parameterized Learnability of k-Juntas and Related Problems
Lecture Notes in Computer Science | 2008-08-19 | Paper |
The Orbit Problem Is in the GapL Hierarchy
Lecture Notes in Computer Science | 2008-07-10 | Paper |
SZK proofs for black-box group problems
Theory of Computing Systems | 2008-06-17 | Paper |
A Logspace Algorithm for Partial 2-Tree Canonization
Computer Science – Theory and Applications | 2008-06-05 | Paper |
The Space Complexity of k-Tree Isomorphism
Algorithms and Computation | 2008-05-27 | Paper |
The Monomial Ideal Membership Problem and Polynomial Identity Testing
Algorithms and Computation | 2008-05-27 | Paper |
On Isomorphism and Canonization of Tournaments and Hypertournaments
Algorithms and Computation | 2008-04-24 | Paper |
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
Algorithms and Computation | 2008-04-24 | Paper |
On Hypergraph and Graph Isomorphism with Bounded Color Classes
STACS 2006 | 2008-03-19 | Paper |
Algorithmic Problems for Metrics on Permutation Groups
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
The Complexity of Black-Box Ring Problems
Lecture Notes in Computer Science | 2007-09-10 | Paper |
A Polynomial Time Nilpotence Test for Galois Groups and Related Results
Lecture Notes in Computer Science | 2007-09-05 | Paper |
SZK Proofs for Black-Box Group Problems
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Graph Isomorphism is in SPP
Information and Computation | 2006-06-30 | Paper |
A family of quantum stabilizer codes based on the Weyl commutation relations over a finite field
| 2006-02-17 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2005-08-12 | Paper |
scientific article; zbMATH DE number 1979521 (Why is no real title available?)
| 2003-09-14 | Paper |
Arithmetic complexity, Kleene closure, and formal power series
Theory of Computing Systems | 2003-08-26 | Paper |
scientific article; zbMATH DE number 1919505 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2003-05-27 | Paper |
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Numerical analysis of optical fibers with arbitrary refractive index profile
Journal of Electromagnetic Waves and Applications | 2002-08-01 | Paper |
On pseudorandomness and resource-bounded measure
Theoretical Computer Science | 2001-08-20 | Paper |
A nonadaptive NC checker for permutation group intersection
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1500534 (Why is no real title available?)
| 2001-06-13 | Paper |
The complexity of modular graph automorphism
SIAM Journal on Computing | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1555928 (Why is no real title available?)
| 2001-01-24 | Paper |
scientific article; zbMATH DE number 1522925 (Why is no real title available?)
| 2000-10-30 | Paper |
scientific article; zbMATH DE number 1500525 (Why is no real title available?)
| 2000-09-04 | Paper |
The counting complexity of group-definable languages
Theoretical Computer Science | 2000-08-21 | Paper |
Exact learning via teaching assistants
Theoretical Computer Science | 2000-08-21 | Paper |
scientific article; zbMATH DE number 1304328 (Why is no real title available?)
| 2000-01-09 | Paper |
scientific article; zbMATH DE number 1333601 (Why is no real title available?)
| 1999-09-19 | Paper |
scientific article; zbMATH DE number 1318517 (Why is no real title available?)
| 1999-08-08 | Paper |
scientific article; zbMATH DE number 1301107 (Why is no real title available?)
| 1999-06-15 | Paper |
Constructivizing Membership Proofs in Complexity Classes
International Journal of Foundations of Computer Science | 1998-07-27 | Paper |
Solvable black-box group problems are low for PP
Theoretical Computer Science | 1998-07-22 | Paper |
scientific article; zbMATH DE number 1136076 (Why is no real title available?)
| 1998-07-16 | Paper |
scientific article; zbMATH DE number 1104167 (Why is no real title available?)
| 1998-05-25 | Paper |
A note on decision versus search for graph automorphism
Information and Computation | 1997-11-12 | Paper |
Monotonous and randomized reductions to sparse sets
RAIRO - Theoretical Informatics and Applications | 1997-04-29 | Paper |
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science | 1997-02-28 | Paper |
Geometric sets of low information content
Theoretical Computer Science | 1997-02-27 | Paper |
Quasi-linear truth-table reductions to \(p\)-selective sets
Theoretical Computer Science | 1997-02-27 | Paper |
Upper bounds for the complexity of sparse and tally descriptions
Mathematical Systems Theory | 1996-02-20 | Paper |
ON HELPING AND INTERACTIVE PROOF SYSTEMS
International Journal of Foundations of Computer Science | 1995-10-29 | Paper |
scientific article; zbMATH DE number 512798 (Why is no real title available?)
| 1994-03-10 | Paper |
On a Hierarchy of Spectral Invariants for Graphs
| N/A | Paper |
