yusuke1997/dblp-id-title huggingface dataset:
Equations in Free Partially Commutative Monoids
PAC Learning with Simple Examples
Tight RNC Approximations to Max Flow
On Locally Optimal Alignments in Genetic Sequences
Residue Domination in Bounded-Treewidth Graphs
Natural Semantics
A New Approach To Information Theory
Binary Exponential Backoff Is Stable for High Arrival Rates
l-Occurrences of Avoidable Patterns
The Minimum Oracle Circuit Size Problem
On Optimal Algorithms and Optimal Proof Systems
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts
Fault Masking Probabilities with Single and Multiple Signature Analysis
The Complexity of Copy Constant Detection in Parallel Programs
A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract)
The Recognition of Tolerance and Bounded Tolerance Graphs
Random Fruits on the Zielonka Tree
Alternation for Two-way Machines with Sublogarithmic Space
A Further Step towards a Theory of Regular MSC Languages
DAG-Width and Parity Games
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds
The Average Time Complexity to Compute Prefix Functions in Processor Networks
Resource-Bounded Instance Complexity (Extended Abstract)
Shuffle of omega-Words: Algebraic Aspects (Extended Abstract)
A Cubic Kernel for Feedback Vertex Set
Parameterized Saga of First-Fit and Last-Fit Coloring
Constant Factor Approximation for Capacitated k-Center with Outliers
A Discrete Subexponential Algorithm for Parity Games
Gap-Definability as a Closure Property
Space-Efficient String Indexing for Wildcard Pattern Matching
Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk)
On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
Resource-Bounded Kolmogorov Complexity Revisited
Trace Rewriting: Computing Normal Forms in Time O(n log n)
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
Efficient Simulations among Several Models of Parallel Computers
A Parametric Analysis of the State Explosion Problem in Model Checking
Broadcasting in Butterfly and DeBruijn Networks
Optimal Broadcasting in Almost Trees and Partial k-trees
The SDP Value for Random Two-Eigenvalue CSPs
Decision Problems for Term Rewriting Systems and Recognizable Tree Languages
Approximating Airports and Railways
Operational Specifications with Built-Ins
The #CSP Dichotomy is Decidable
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs
A Prossible Code in the Genetic Code
Model Checking Lossy Vector Addition Systems
Colouring Random Graphs in Expected Polynomial Time
Iterative Devices Generating Infinite Words
Space-Efficient Deterministic Simulation of Probabilistic Automata (Extended Abstract)
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
The Complexity of Constraints on Intervals and Lengths
Decidability Questions for Fairness in Petri Nets
Comparing 1D and 2D Real Time on Cellular Automata
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
Construction of mu-Limit Sets of Two-dimensional Cellular Automata
Matrix Rigidity from the Viewpoint of Parameterized Complexity
Some Recent Advancements in Monotone Circuit Complexity (Invited Talk)
Compact Representation for Matrices of Bounded Twin-Width
Shortest Paths Avoiding Forbidden Subpaths
Models and Techniques for Communication in Dynamic Networks
Structure-Guided Automated Reasoning
Desert Automata and the Finite Substitution Problem
On Quantum Versions of the Yao Principle
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations
Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries
Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
Monadic Second Order Logic on Tree-Like Structures
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Threshold Circuits for Iterated Multiplication: Using AC0 for Free
Algebraic Specifications for Domain THeory
Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System Verification
A Simple and Fast Approach for Solving Problems on Planar Graphs
Minimizing NFA's and Regular Expressions
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
Linear Programming - Randomization and Abstract Frameworks
6-Uniform Maker-Breaker Game Is PSPACE-Complete
Balanced Partitions of Trees and Applications
Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability
The dimension of ergodic random sequences
Parallel Algorithms Reconsidered (Invited Talk)
A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees
Actors as a Parallel Programming Model
On the Structure of Valiant's Complexity Classes
Local Enumeration: The Not-All-Equal Case
STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings
Robust Polynomials and Quantum Algorithms
A Combinatorial Bound for Linear Programming and Related Problems
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity
Light Orthogonal Networks with Constant Geometric Dilation
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
Determining a Slater Winner Is Complete for Parallel Access to NP
Regular Expressions and Context-Free Grammars for Picture Languages
STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings
Editing to Connected f-Degree Graph
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
LPC: A Concurrent Programming Laboratory
On Genuinely Time Bounded Compuations
Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position
Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means
The Random Testability of the n-Input AND Gate
Some Results on Fairness: The Regular Case
On Generalized Kolmogorov Complexity
More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP
The Complexity of Unions of Disjoint Sets
Quantum Advantage for the LOCAL Model in Distributed Computing
Synchronizing Relations on Words
Inference and Mutual Information on Random Factor Graphs
On Dualization in Products of Forests
Lower Bounds on Learning Decision Lists and Trees (Extended Abstract)
VPSPACE and a Transfer Theorem over the Reals
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
Ehrenfeucht-Fraïssé Goes Automatic for Real Addition
Graph^Ed: An Interactive Garpg Editor
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Hamburg, Germany, March 7-9, 2023
The Complexity of Planarity Testing
Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms
Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats
Ground Reducibility and Automata with Disequality Constraints
On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract)
Optimal Pattern Matching on Meshes
Generalized Modal Satisfiability
Speeding up Random Access Machines by Few Processors
Iterative Methods in Combinatorial Optimization (Invited Talk)
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
Integral Symmetric 2-Commodity Flows
A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location
On Quantum Algorithms for Noncommutative Hidden Subgroups
Constrained Binary Identification Problem
Counting Overlap-Free Binary Words
Autoreducibility of NP-Complete Sets
Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering
A Toolkit for First Order Extensions of Monadic Games
The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Star-Height of an N-Rational Series
The Boolean Hierarchy of NP-Partitions
Geometric Set Cover and Hitting Sets for Polytopes in R 3
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract)
Unified Algebras and Action Semantics
Parameterized Complexity of Small Weight Automorphisms
Divide-and-Conquer Algorithms on the Hypercube
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order
Local dependency dynamic programming in the presence of memory faults
Dynamic Planar Point Location with Optimal Query Time
Alpha du Centaur: An Environment for the Design of Systolic Arrays
Detection of Deadlocks in an Infinite Family of Nets
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion
On the Difference of Horn Theories
Radix Representations of Algebraic Number Fields and Finite Automata
On the Power of Several Queues
Improved Bounds for Online Preemptive Matching
Efficient Distributed Algorithms by Using the Archemedean Time Assumption
Observations on Measure and Lowness for Delta^P_2
On Syntactic Congruences for Omega-Languages
Online Simple Knapsack with Bounded Predictions
Temporal Logics for the Specification of Performance and Reliability
Extended Regular Expressions: Succinctness and Decidability
Weak index versus Borel rank
Voronoi Diagrams Based on General Metrics in the Plane
An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract)
lambda-Coloring of Graphs
On Realizing Iterated Multiplication by Small Depth Threshold Circuits
Computational Complexity and Partition Functions (Invited Talk)
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Stochastic Scheduling on Unrelated Machines
Streaming Complexity of Spanning Tree Computation
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk)
A Random NP-Complete Problem for Inversion of 2D Cellular Automata
An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version)
A Hierarchy of Temporal Logics with Past (Extended Abstract)
Randomness in Visual Cryptography
Relations Between Greedy and Bit-Optimal LZ77 Encodings
Combination of Matching Algorithms
On the Minimal Hardware Complexity of Pseudorandom Function Generators
Conflict-Free Colorings of Rectangles Ranges
General Inductive Inference Types Based on Linearly-Ordered Sets
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
Unconditional Byzantine Agreement with Good Majority
Counting Temporal Paths
Star-Free Open Languages and Aperiodic Loops
Pro-Aperiodic Monoids via Saturated Models
Approximation of smallest linear tree grammar
On the Contact-Minimization-Problem
Blocage et vivacité dans les réseaux a pile-file
The Power Range Assignment Problem in Radio Networks on the Plane
Dynamic Analysis of the Sizes of Relations
Sorting and Searching on the Word RAM
The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols
STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings
Optimization, Complexity and Invariant Theory (Invited Talk)
On the Computational Power of Boolean Decision Lists
Classes of Intersection Digraphs with Good Algorithmic Properties
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation
New Pairwise Spanners
Fonctions Génératrices Transcendantes à Coefficients Engendrés par Automates
Robust and Adaptive Search
Domino Problem Under Horizontal Constraints
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences
Tradeoffs in Depth-Two Superconcentrators
Relating Branching Program Size and Formula Size over the Full Binary Basis
Depth-3 Circuit Lower Bounds for k-OV
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata
A speed-up of oblivious multi-head finite automata by cellular automata
STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings
Controlled Conspiracy-2 Search
A Faster Algorithm for Vertex Cover Parameterized by Solution Size
Improved Approximation Algorithms for Balanced Partitioning Problems
The Complexity of Approximating Bounded-Degree Boolean #CSP
STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings
The Ring of k-Regular Sequences
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab * c
Existential and Positive Theories of Equations in Graph Products
Generalised Pattern Matching Revisited
On the Structure of Parameterized Problems in NP (Extended Abstract)
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata
Explicit relation between all lower bound techniques for quantum query complexity
Beyond omega-Regular Languages
Faster Graph Algorithms Through DAG Compression
Weak MSO with the Unbounding Quantifier
Estimating Entropy and Entropy Norm on Data Streams
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy
Bipartite Diameter and Other Measures Under Translation
Optimal Tree-Based One-Time Digital Signature Schemes
The Extended Low Hierarchy Is an Infinite Hierarchy
Named Models in Coalgebraic Hybrid Logic
Online Scheduling with Interval Conflicts
On Nash Equilibria in Non-cooperative All-Optical Networks
Stackelberg Network Pricing Games
Grid Vertex-Unfolding Orthogonal Polyhedra
Independent Sets near the Lower Bound in Bounded Degree Graphs
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes
Everywhere complex sequences and the probabilistic method
A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph
One Bit of Advice
Correlations of Partial Words
The Complexity of the Max Word Problem
The Complexity of Constraint Satisfaction Problems (Invited Talk)
Are Parallel Machines Always Faster than Sequential Machines? (Preliminary Version)
On the Construction of Abstract Voronoi Diagrams
Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability
The Price of Truth: Frugality in Truthful Mechanisms
Existential Length Universality
STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings
An Algorithm for Two-Layer Channel Routing
Greibach Normal Form Transformation, Revisited
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
Hyper-Encryption and Everlasting Security
A 10-Approximation of the π/2-MST
Sorting and Recognition Problems for Ordered Sets
Derandomized Graph Product Results Using the Low Degree Long Code
On Compact Representations of Propositional Circumscription
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties
Improved Weighted Matching in the Sliding Window Model
Approximations for ATSP with Parametrized Triangle Inequality
On Selecting the Largest Element in Spite of Erroneous Information
On the Synthesis of Strategies in Infinite Games
Separability of Reachability Sets of Vector Addition Systems
Optimal Cache-Aware Suffix Selection
An Explicit Lower Bound for TSP with Distances One and Two
Concatenable Segment Trees (Extended Abstract)
The Tandem Duplication Distance Is NP-Hard
Surjective H-Colouring over Reflexive Digraphs
A Set-Theoretic Translation Method for (Poly)modal Logics
The Rank of Tree-Automatic Linear Orderings
An Algebraic Approach to Vectorial Programs
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
Rounds versus Time for the Two Person Pebble Game (Extended Abstract)
Online Disjoint Set Covers: Randomization Is Not Necessary
Faster Algorithms for the Constrained k-Means Problem
Spectral Approach to the Communication Complexity of Multi-Party Key Agreement
Approximation of Convex Figures by Pairs of Rectangles
Modal Separation of Fixpoint Formulae
Search using queries on indistinguishable items
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points
Algorithms for Designing Pop-Up Cards
Bounded-Variable Fragments of Hybrid Logics
Minimal Forbidden Words and Symbolic Dynamics
On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems
On the Expressivity of the Modal Mu-Calculus
Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract)
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios
Caterpillars and Context-Free Languages
Searching for better fill-in
On the Approximability of the Maximum Common Subgraph Problem
Distance Computations in the Hybrid Network Model via Oracle Simulations
Logic as a Query Language: From Frege to XML
Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)
Regularity Problems for Visibly Pushdown Languages
The AC⁰-Complexity of Visibly Pushdown Languages
Distributed Termination in CSP: Symmetric Solutions with Minimal Storage
Bounded-width QBF is PSPACE-complete
An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs
Some Undecidability Results Related to the Star Problem in Trace Monoids
Fragments of First-Order Logic over Infinite Words
Structure of Relations Satisfying Certain Families of Dependencies
Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
Parallel Comparability Graph Recognition and Modular Decomposition
Tight Approximation Guarantees for Concave Coverage Problems
Monomials in arithmetic circuits: Complete problems in the counting hierarchy
A Framework of Quantum Strong Exponential-Time Hypotheses
Representing Graph Metrics with Fewest Edges
Cardinality and counting quantifiers on omega-automatic structures
On the Complexity of Affine Image Matching
Optimization in Arrangements
RNC-Approximation Algorithms for the Steiner Problem
Quasilinear Time Complexity Theory
Worst-case Equilibria
Optimizing Tree Decompositions in MSO
Good Predictions Are Worth a Few Comparisons
The Parallel Complexity of Tree Embedding Problems (Extended Abstract)
A Fully Abstract Semantics for Causality in the Pi-Calculus
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
The Complexity of Homomorphism Reconstructibility
A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version)
Defining Lambda-Typed Lambda-Calculi by Axiomatizing the Typing Relation
Preemptive and Non-Preemptive Generalized Min Sum Set Cover
Ehrenfeucht-Fraïssé Games on Omega-Terms
Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract)
Reversals and Alternation
Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
Recurrence in Infinite Words
On Expressive Interpretations of a Hoare-Logic for Clarke's Language L4
Approximability of Robust Network Design: The Directed Case
A New Rank Technique for Formula Size Lower Bounds
On the Complexity of Worst Case and Expected Time in a Circuit
Unconditional Byzantine Agreement for any Number of Faulty Processors
An optimal quantum algorithm for the oracle identification problem
Online Correlation Clustering
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs
A Space Lower Bound for Routing in Trees
Fast Computations of the Exponential Function
On Hypergraph and Graph Isomorphism with Bounded Color Classes
Four Results on Randomized Incremental Constructions
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
Rectangle Visibility Graphs: Characterization, Construction, and Compaction
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem
Oracle Complexity Classes and Local Measurements on Physical Hamiltonians
Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval
Hard Metrics from Cayley Graphs of Abelian Groups
On Dynamic Breadth-First Search in External-Memory
Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk)
A Logical Characterization of Systolic Languages
On Average Baby PIH and Its Applications
Optimal Simulations Between Unary Automata
The Complexity of the Distributed Constraint Satisfaction Problem
Unary Quantifiers, Transitive Closure, and Relations of Large Degree
The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs
On Multipartition Communication Complexity
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Cell Flipping in Permutation Diagrams
The Complexity of Recognizing Unique Sink Orientations
"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics
On a General Weight of Trees
Performance Driven k-Layer Wiring
Inseparability and Strong Hypotheses for Disjoint NP Pairs
Properties of Infinite Words: Recent Result
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations
Approximating Densest Subgraph in Geometric Intersection Graphs
Treewidth of Bipartite Graphs
A First-Order Isomorphism Theorem
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems
Constant compression and random weights
Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
Generalized Reordering Buffer Management
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields
Distributed Computing on TRansitive Networks: The Thorus
Shortest Two Disjoint Paths in Conservative Graphs
Data-Oblivious Data Structures
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs
Two-Page Book Embeddings of 4-Planar Graphs
Testing Shape Restrictions of Discrete Distributions
On the Complexity of Unary Tiling-Recognizable Picture Languages
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
Cardinality Constrained Scheduling in Online Models
Computing Shortest Paths with Uncertainty
The Firing Squad Problem Revisited
Pattern Occurrences in Multicomponent Models
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
AMS Without 4-Wise Independence on Product Domains
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
Halting Problem of One Binary Horn Clause is Undecidable
A Complexity Dichotomy for Partition Functions with Mixed Signs
On the Complexity of Approximating the Independent Set Problem
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two