yusuke1997/dblp-id-title huggingface dataset:
On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper)
Logical Characterizations of Weighted Complexity Classes
Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract)
Inducing Patterns of Behaviour in Distributed System Parts
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets
Gaußian Elimination and a Characterization of Algebraic Power Series
Definability and Transformations for Cost Logics and Automatic Structures
From Three Ideas in TCS to Three Applications in Bioinformatics
Nearest Neighbor Search in High-Dimensional Spaces
Completeness Problems in Verification of Programs and Program Schemes
VPSPACE and a Transfer Theorem over the Complex Field
Aperiodic Weighted Automata and Weighted First-Order Logic
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols
Polynomially Complete Problems in the Logic of Automated Discovery
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes
The Price of Connectivity for Cycle Transversals
Complexity of Data Tree Patterns over XML Documents
Guarding Offices with Maximum Dispersion
A Crossing Measure for 2-Tape Turing Machines
Distances Between Languages and Reflexivity of Relations
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems
On the Structure of Optimal Greedy Computation (for Job Scheduling)
48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, Bordeaux, France, August 28 - September 1, 2023
On the Formal Definition of Assembly Languages
Linking Focusing and Resolution with Selection
Degree-Preserving Forests
On Strict Codes
Expressive Completeness of Temporal Logic of Action
On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report)
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages
On Hybrid Eco-Rewriting Systems
The Structure of Polynomial Complexity Cores (Extended Abstract)
Context Free Normal Systems
Learning Deterministic Visibly Pushdown Automata Under Accessible Stack
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages
Improved Bounds for Reduction to Depth 4 and Depth 3
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations
On the Parameterized Complexity of Exact Satisfiability Problems
Space-Conscious Compression
Decision Problems for Edge Grammars
The OI-Hierarchy is Closed under Control
Safe Implementation Equivalence for Asynchronous Nondeterministic Processes
On NC 1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge
Energy-Efficient Communication in Multi-interface Wireless Networks
Which Is the Worst-Case Nash Equilibrium?
The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
Efficient Equilibria in Polymatrix Coordination Games
Determinism in Concurrent Systems
On the Stretch Factor of Polygonal Chains
On the Sequential Relations of Time-Invariant Automata
On a Quantitative Notion of Uniformity
Self-Similarity Viewed as a Local Property via Tile Sets
The Fluted Fragment with Transitivity
Reachability Analysis of Recursive Quantum Markov Chains
Minimum 0-Extension Problems on Directed Metrics
Partially Commutative Inverse Monoids
A Semantical Model for Integration and Modularization of Rules
Procedures, Formal Computations and Models
On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape Automata
Regular Expressions with Counting: Weak versus Strong Determinism
Active Linking Attacks
Simplified Game of Life: Algorithms and Complexity
Tree Tribes and Lower Bounds for Switching Lemmas
Grammatical Levels of the Position Restricted Grammars
Step-Out Ring Signatures
On the Degree of Ambiguity of Finite Automata
Approximating the Orthogonality Dimension of Graphs and Hypergraphs
Observability Concepts in Abstract Data Type Specifications
List Homomorphism Problems for Signed Graphs
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
Syntactic Minimization Of Nondeterministic Finite Automata
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard
Algebraic Closed Theories
On ( k , l )-Leaf Powers
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
The Mergegram of a Dendrogram and Its Stability
Proving Properties of Programs by Means of Predicate Logic
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
A Characterization of Sturmian Morphisms
On Sequential Modelling of Non-Sequential Processes
Regulations by Valences
Performance Preorder: Ordering Processes with Respect to Speed
String Matching with Constraints
Regular Monoidal Languages
Edge-Bisection of Chordal Rings
Reduction of Petri-Nets
Noninterference with Local Policies
Δ 2 p -Complete Lexicographically First Maximal Subgraph Problems
An Alternative, Priority-Free, Solution to Post's Problem
On the Clique Editing Problem
Counting Minimum ( s , t )-Cuts in Weighted Planar Graphs in Polynomial Time
Page Migration in Dynamic Networks
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances
Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds
Exercises in Denotational Semantics
Isometric Embeddings in Trees and Their Use in Distance Problems
Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator
Algebraic Models I
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
Transformation Between Regular Expressions and omega-Automata
Packing and Squeezing Subgraphs into Planar Graphs
Mathematical Foundations of Computer Science 1978, Proceedings, 7th Symposium, Zakopane, Poland, September 4-8, 1978
Cooperating Grammar Systems
Conditionally Optimal Algorithms for Generalized Büchi Games
Linear Time Subsequence and Supersequence Regex Matching
Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications
Parallel Recursive Program Schemes
Elimination of Negation in Term Algebras
Internal Labellings in Lambda-Calculus
Abstract Data Types: A Retrospective and Prospective View
Computationally-Sound Checkers
An Almost Linear Robinson Unification ALgorithm
Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings
On the Complexity of Game Isomorphism
Persistent Homology under Non-uniform Error
Petri Net Reachability Problem (Invited Talk)
C_{2k+1}-Coloring of Bounded-Diameter Graphs
The Complexity of Tensor Circuit Evaluation
Conditional Metric Completeness of Finite Sets of Automata: A Criterion and an Algorithm (in Russian)
New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming
Minimal Chordal Sense of Direction and Circulant Graphs
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
Schematics of Structural Parallel Programming and its Applications
Contracting a Chordal Graph to a Split Graph or a Tree
Quantum Relaxations of CSP and Structure Isomorphism
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
VC Density of Set Systems Definable in Tree-Like Graphs
A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract)
Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract)
Transforming Recursive Equations to Algorithms
Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings
Higher Connectivity in Directed Graphs (Invited Talk)
Optimal Strategies in Pushdown Reachability Games
Complexity of Equivalence and Learning for Multiplicity Tree Automata
Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings
Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
Approximate and Exact Deterministic Parallel Selection
Merging and Sorting Strings in Parallel
Harnessing ML F with the Power of System F
A Note on the Advice Complexity of Multipass Randomized Logspace
Deadlocking States in Context-Free Process Algebra
Note on Minimal Finite Automata
On the Problem of Finding Natural Computational Complexity Measures
Characterizing Unambiguous Augmented Pushdown Automata by Circuits
Testing Approximate Symmetry in the Plane is NP-hard
Randomization in Non-Uniform Finite Automata
Traces of Term-Automatic Graphs
Asymptotic Monadic Second-Order Logic
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
Some Sources of Primitive Constructs in Programming Languages
On the Relationship between a Procedure and its Data
Minimal Gödel Numbers and Their Identification in the Limit
Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols
Fixed-Points and Algebras with Infinitely Long Expressions, I
Basic Properties for Sand Automata
The Calculus of Facts
Functions Computable in the Limit by Probabilistic Machines
The Freeness Problem for Automaton Semigroups
Equations X + A = B and (X + X) + C = (X - X) + D over Sets of Natural Numbers
Realizing Finitely Presented Groups as Projective Fundamental Groups of SFTs
Invariantization of Listings
Towards a Rice Theorem on Traces of Cellular Automata
Connecting Constructive Notions of Ordinals in Homotopy Type Theory
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
Complexity of DNF and Isomorphism of Monotone Formulas
K4-free Graphs as a Free Algebra
Nondterministically Recognizable Sets of Languages
Advances in Parametric Real-Time Reasoning
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets
An Operator Calculus Approach to the Evolution of Dynamic Data Structures
Separating the Eraser Turing Machine Classes L e , NL e , co-NL e and P e
On the Query Complexity of Sets
Construction of Complete Sample System for Correctness Testing
On the Complexity of Slice Functions
Connected Searching of Weighted Trees
Coloring Graphs Characterized by a Forbidden Subgraph
Positional Strategies for Higher-Order Pushdown Parity Games
Critical Pairs in Term Graph Rewriting
A Strategy for Speeding-up the Computation of Characteristic Sets
Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development
Negation Elimination in Equational Formulae
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
A Constant-Time Colored Choice Dictionary with Almost Robust Iteration
Fully Abstract Semantics for Higher Order Communicating Systems
Algorithmic Lower Bounds for Problems on Decomposable Graphs
Networks of Language Processors: Distributed Communicating Architectures in Grammar Systems
Recent Results on L Systems
Symmetric-Difference (Degeneracy) and Signed Tree Models
Regular Resynchronizability of Origin Transducers Is Undecidable
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps
Derandomization for Sparse Approximations and Independent Sets
Fractional Covers of Hypergraphs with Bounded Multi-Intersection
A New Category for Semantics
LEDA: A Library of Efficient Data Types and Algorithms
Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds
Complexity Note on Mixed Hypergraphs
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
Mathematical Foundations of Computer Science 1980 (MFCS'80), Proceedings of the 9th Symposium, Rydzyna, Poland, September 1-5, 1980
Optimally Fast Data Gathering in Sensor Networks
Isomorphism Problem for S_d-Graphs
Mathematical Foundations of Computer Science 1992, 17th International Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings
Knuth-Morris-Pratt Algorithm: An Analysis
Relationships between Probabilistic and Deterministic Tape Complexity
On the Ehrenfeucht Conjecture on Test Sets and Its Dual Version
Shuffle Expressions and Words with Nested Data
Semantics of Infinite Processes Using Generalized Trees
On the Repetition Threshold for Large Alphabets
Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract)
Formal Power Series and Growth Functions of Lindenmayer Systems
Space-Efficient Parallel Algorithms for Combinatorial Search Problems
Easy Multiple-Precision Divisors and Word-RAM Constants
Equivalences of Parallel Courses of Algorithmic Nets and Precedence Flow Diagrams
Budgeted Dominating Sets in Uncertain Graphs
Finite Test-Sets for Overlap-Free Morphisms
On the Limits of Gate Elimination
Denotational Testing Semantics in Coinductive Form
The Complexity of Model Checking Higher Order Fixpoint Logic
Online Algorithms with Predictions (Invited Talk)
Generating Functions of Timed Languages
Parameterized Approximations via d-Skew-Symmetric Multicut
On the Expressive Power of Regular Expressions with Backreferences
Positive Turing and Truth-Table Completeness for NEXP Are Incomparable
On Congruences and Partial Orders
Comparing Counting Classes for Logspace, One-way Logspace, and First-order
Propositional Dynamic Logic with Strong Loop Predicate
Solving Systems of Linear Diophantine Equations: An Algebraic Approach
Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism
Recognizable Complex Trace Languages
Counting Homomorphisms to Trees Modulo a Prime
Better Complexity Bounds for Cost Register Automata
Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of Programs
Towards a Theory of Inductive Inference (in Russian)
The Dynamic Descriptive Complexity of k-Clique
Stable States of Perturbed Markov Chains
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets
Algebraic Reasoning for (Un)Solvable Loops (Invited Talk)
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
An Exponential Lower Bound for One-Time-Only Branching Programs
The Firing Squad Synchronization Problem on Cayley Graphs
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams
On the Complexity of Small Description and Related Topics
On Fast Algorithms for Two Servers
On the Impact of Fair Best Response Dynamics
An Algebraic Characterization of Unary Two-Way Transducers
On the Lower Bound for Minimum Comparison Selection
A Logical Approach to the Problem "P=NP?"
The Complexity of The Reliable Connectivity Problem
Communication Throughput of Interconnection Networks
ω-Forest Algebras and Temporal Logics
Quantum vs. Classical Proofs and Subset Verification
Two Algorithms for Approximate String Matching in Static Texts
Paths and Cycles in Finite Periodic Graphs
Reversible Kleene lattices
Online Bipartite Matching and Adwords (Invited Talk)
Optimal Algorithms and a PTAS for Cost-Aware Scheduling
Domains for Higher-Order Games
Why are CSPs Based on Partition Schemes Computationally Hard?
Small Depth Proof Systems
Cycles of Partial Orders
Model Checking and Validity in Propositional and Modal Inclusion Logics
An Abstract Account of Composition
Region Analysis and a pi-Calculus wiht Groups
Positive Data Languages
Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract)
Multiple Propositional Dynamic Logic of Parallel Programs (Extended Abstract)
Computing Sharp 2-Factors in Claw-Free Graphs
Concurrency, Modularity, and Synchronization
Switching Graphs and Their Complexity
Synthesizing Distinguishing Formulae for Real Time Systems (Extended Abstract)
More about the "Geography" of Context-Free Languages
Towards an Efficient Merging
Reliable Minimum Finding Comparator Networks
Model Checking Stochastic Branching Processes
Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP
Memory and Algebra
Logically Defined Subsets of N k
Definitions and Comparisons of Local Computations on Graphs
How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking
Predicative Polymorphic Subtyping
Distance Constraint Satisfaction Problems
Improved Simulation of Nondeterministic Turing Machines
Isomorphisms between Predicates and State Transformers
Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras
The Membership Problem for Context-Free Chain Code Picture Languages
Restricted Branching Programs and Their Computational Power
Properties of Complexity Measures for PRAMs and WRAMs
The Domino Problem is Undecidable on Surface Groups
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs
Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields
Refined Search Tree Technique for DOMINATING SET on Planar Graphs
Computing the Minimum Bottleneck Moving Spanning Tree
Node-Label Controllel Graph Grammars
Complexity and Entropy
Uniform Random Expressions Lack Expressivity
Formal Transformations and the Development of Programs
The Two Queries Assumption and Arthur-Merlin Classes
Randomness Versus Superspeedability
The Process Complexity and the Understanding of Sequences
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)
Real Number Computability and Domain Theory
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
Graph Characterization of the Universal Theory of Relations
A Class of Information Logics with a Decidable Validity Problem
List-Decodability of Structured Ensembles of Codes (Invited Talk)
Context-Free Algebra: A Mathematical Device for Compiler Specifications
On Configurations in Cellular Automata
A Calculus for Higher Order Procedures with Global Variables
On the Number of Quantifiers as a Complexity Measure
Ranked Structures in Nonmonotonic Reasoning and Belief Revision: Abstract
On the Computational Complexity of Codes in Graphs
Limits, Higher Type Computability and Type-Free Languages
On the Correlation Between Parity and Modular Polynomials
Some Logical Problems of Automated Research
A Generalized Computability Thesis (Abstract)
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression
A Sup-Preserving Completion of Ordered Partial Algebras
Decidability Results on a Query Language for Data Bases with Incomplete Informations
On Functional Grammars
Probabilistic Analysis of Power Assignments
On the Nature of Events
Applications of Littlestone Dimension to Query Learning and to Compression
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs
Finding Consensus Strings with Small Length Difference Between Input and Solution Strings
Reversal-Bounded Counter Machines Revisited
Computational Complexity of Covering Regular Trees
Algorithmic Dimensions via Learning Functions
Probabilistic Automata with Isolated Cut-Points
On the Parameterized Complexity of Cutting a Few Vertices from a Graph
Consistency for Counting Quantifiers
Specifying and Verifying Parametric Processes
Foundations of Modular SOS
Iterative Compression and Exact Algorithms
On the Complexity of Hub Labeling (Extended Abstract)
A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs
The Complexity of Transitively Orienting Temporal Graphs
Polynomial Threshold Functions and Boolean Threshold Circuits
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
An Algebraic Approach to Problem Solution and Problem Semantics
Process Logics: Two Decidability Results
Sensitivity and Query Complexity Under Uncertainty
Name Independence and Database Abstraction in the Relational Model
The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle
On Problems Solvable by Successive Trials
Improved Upper Bounds for the Rigidity of Kronecker Products
On the Computational Complexity of Infinite Words
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty
A Polynomial Time Nilpotence Test for Galois Groups and Related Results
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms
Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic Dictionaries
A Quasiorder-Based Perspective on Residual Automata
Variations on Inductive-Recursive Definitions
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework
Quantum Communication Complexity of Distributed Set Joins
Approximation Schemes for the Min-Max Starting Time Problem
On Structural Similarity of Context-Free Grammars
Group Coloring and List Group Coloring Are Pi 2 P-Complete (Extended Abstract)
Lost in Self-Stabilization
There Are No Sparse NP W -Hard Sets
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
Resource Combinatory Algebras
Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem
A New Space Bound for the Modal Logics K4, KD4 and S4
Strict Language Inequalities and Their Decision Problems
On Sets of Complex-Programmed Numbers
Uniform Generation in Trace Monoids
Combinatorial Aspects of Information Storage and Retrieval
Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis
The Bodnarchuk Metric Space of Languages and the Topology of the Learning Space
Arithmetic Circuits, Monomial Algebras and Finite Automata
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract)
Symbolic Topological Sorting with OBDDS
Online Maximum Matching with Recourse
Parameterized Study of the Test Cover Problem
Diameter Versus Certificate Complexity of Boolean Functions
A Combinatorial Approach to Collapsing Words
Spectral Aspects of Symmetric Matrix Signings
Recent Results in the Theory of Rational Sets
Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses
Minimal While Programs
Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
On Diagnosis of Algorithmical Processes
Shortest Paths in Multimode Graphs
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Families of DFAs as Acceptors of omega-Regular Languages
Length-Increasing Reductions for PSPACE-Completeness
Symmetric Functions in AC 0 A Can Be Computed in Constant Depth With Very Small Size
Nondeterministic Logspace Reductions
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
Concurrent Programs
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory
Action Calculi, or Syntactic Action Structures
An Expressive Logic for Basic Process Algebra
On One-Pass Term Rewriting
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
Computing Linear Systems of First-order Equations on Integers and Naturals by Simple Eco-grammars
Query-Competitive Sorting with Uncertainty
Compositional Verification: Decidability Issues Using Graph Substitutions
TC 0 Circuits for Algorithmic Problems in Nilpotent Groups
Mathematical Foundations of Computer Science 1975, 4th Symposium, Mariánské Lázne, Czechoslovakia, September 1-5, 1975, Proceedings
On Pseudorandom Generators in NC
VLSI Algorithms and Architectures
Topological Definitions of Chaos Applied to Cellular Automata Dynamics
Applications of Finite Automata
Two-Way Finite State Transducers with Nested Pebbles
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete